许久的学习小窝

方便模板套用，最开始记不住，多敲几遍就好了#include#includeusing namespace std;const int maxn = 10005;struct node{ int from,to,dis; }edge[maxn];int n,fa[maxn],m,ans,q;bool cmp(node a,node b){ return a.dis<b.dis

用最短路的方法找最长路。。。哎黑心商家没有好结果啊链接：Bad Cowtractors POJ - 2377 ac：#include&lt;iostream&gt;#include&lt;algorithm&gt;using namespace std;const int maxn = 1000005;struct node{ int from,to,dis; }edg...