luogu k层图

k层图典型例题就是能够任意选取k条边使得他们权值变化ios 而后问最短路spa // // Created by xingchaoyue on 2019/7/27. // #include<iostream> #include<cstdio> #include<queue> #include<string.h> using namespace std; const int N = 220010;

>>阅读原文<<