growing_up_的博客

#include #include #include using namespace std; const int N=1001; int n,m,fa[N]; int degree[N],sum; void init() { for(int i=0;i<N;i++) fa[i]=i; } int find(int x) { if(x==fa[x])ret

#include #include #include #include #include #define V 220 using namespace std; struct node { int to; int c; int f; int next; }a[3000]; int head[V]; int tot,vi[V],vo[V]; int leve[V]; v