摘要: "CERC 2014 Pork barrel" Problem : n个点m条边有边权的无向图,有q个询问,每次询问权值在[L,R]内的边组成的最小生成树的权值和,强制在线。 n include include include include include include include incl 阅读全文
posted @ 2017-08-27 23:36 rpSebastian 阅读(212) 评论(0) 推荐(0) 编辑