Path - 2019 Multi-University Training Contest 1

题意有一张n个点,m条边的有向图,切边的代价为边权,要求以最小的代价切掉一些边,使最短路变长思路先跑一遍Dijkstra,获得最短路,然后依照以下方法构造最短路图if(dis[u[i]]+w[i] == dis[v[i]]){ addEdge(u[i],v[i] ...