Warning: session_start(): open(/tmp/sess_3d00b41dfcedd246889f5301f50876dd, O_RDWR) failed: No space left on device (28) in /data/wiki/inc/init.php on line 239
Warning: session_start(): Failed to read session data: files (path: ) in /data/wiki/inc/init.php on line 239
Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/inc/auth.php on line 430
Writing /data/wiki/data/cache/8/878e000dca5c08fe55e62fff31fad8b7.captchaip failed
Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/inc/Action/Export.php on line 103
Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/inc/Action/Export.php on line 103
Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/inc/Action/Export.php on line 103
C
D
E(E dp，以左端点考虑右端点，消除后效性）
F 很有趣的一道题，主要难在求k个点的最小生成树，可以用dijikstra，最开始bel [i in {k}]=i,跟着最短路更新bel，枚举每个边，如果两端的bel不同，那么给两端的bel连边，这样建图即可求最小生成树。
P.S.数组越界越多了似乎返回的是-1073741819。