#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<set>
#include<algorithm>
#include<map>
#include<vector>
#include<queue>
#include<iostream>
#include<string>
#include<cmath>
#define N 300010
#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 x[N],y[N],f[N],n,m,X,flag[N];
int getf(int x){if (f[x]!=x) f[x]=getf(f[x]);return f[x];}
bool check(int k)
{
int i;
FOR(i,1,n) f[i]=i;
memset(flag,0,sizeof(flag));
FOR(i,1,m)
{
if (x[i]<=k||y[i]<=k) continue;
Views:
428
|
Added by:
dhy0077
|
Date:
10.18.2013