#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<set>
#include<algorithm>
#include<map>
#include<vector>
#include<queue>
#include<iostream>
#include<string>
#include<cmath>
#define N 100100
#define FOR(i,a,b) for(i=(a);i<=(b);i++)
#define ROF(i,a,b) for(i=(a);i>=(b);i--)
typedef long long LL;
using namespace std;
int f[N],t[N],n,m;
struct node{int x,y,E;};
int cmp(node a,node b){return a.E<b.E;}
node e[N];
int getf(int x)
{
if (f[x]!=x) f[x]=getf(f[x]);
return f[x];
}
int main()
{
scanf("%d%d",&n,&m);
int i;
FOR(i,1,n) f[i]=i;
Views:
291
|
Added by:
dhy0077
|
Date:
10.12.2013