​​点击打开链接​​ 因为图中每一个点被访问过后权值就消失了所以不能用最短路直接求先缩点然后得一DAG图求最长路即可 if语句后边多了一个分号调了一晚上真的舒服 include<cstdio>include<queue>include<stack>include<cstring>include<algorithm>usingnamespacestd;defineN0x3f3f3f3fstructnode1{intv;intnext;};structnode2{intv;intw;intnext;};stack<int&gt...