畅通工程
摘要:
#include<stdio.h>#include<stdlib.h>#include<string.h>#include<algorithm>using namespace std;struct node{ int i; int j; int v;}T[5000];int father[110],rank[110];int N,M,t;int cmp(node a,node b){ return a.v<b.v;}int find(int x){ return x==father[x]?x:father[x]=find(father[x] 阅读全文
posted @ 2011-04-30 10:32 more think, more gains 阅读(140) 评论(0) 推荐(0) 编辑