zhousilijames的专栏

#include #include#includeusing namespace std;int T,n,m,par[200005],rk[200005];void inital(int &n){ for(int i=0;i<=2*n;i++) { par[i]=i; rk[i]=0; }}int f(int x){

#include #include#include#includeusing namespace std;pair cor[1005];int n,d,par[1005],rk[1005];bool isconnect(int i1,int i2,int d){ return d*d>=(cor[i1].first-cor[i2].first)*(cor[i1].firs

In a country, there are a number of cities. Each pair of city is connected by a highway, bi-directional ofcourse. A road-inspector’s task is to travel through the highways (in either direction) and to

#1689 : 推断大小关系时间限制:20000ms单点时限:2000ms内存限制:256MB描述有N个整数A1, A2, ... AN，现在我们知道M条关于这N个整数的信息。每条信息是：Ai &lt; Aj 或者 Ai = Aj  小Hi希望你能从第一条信息开始依次逐条处理这些信息。一旦能推断出A1和AN的大小关系就立即停止。  输出在处理第几条时第一次推断出A1...