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;

>>阅读原文<<