【并查集】hdu 1272 小希的迷宫

http://acm.hdu.edu.cn/showproblem.php?pid=1272

分析：无向不成环图，其中：房间编号不一定连续，也不一定从1开始。

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int NM=100005;
int father[NM];
bool vis[NM],flag;

int Find(int x){
	int t,p1=x;
	while(p1!=father[p1])
		p1=father[p1];
	while(x!=p1)
	{
		t=father[x];
		father[x]=p1;
		x=t;
	}
	return p1;
}

void Union(int x,int y){
	x=Find(x);y=Find(y);
	if(x!=y){
		father[x]=y;
	}
	else flag=false;
}

int main()
{
	int i,u,mmin,mmax,x,y;
	while(scanf("%d%d",&x,&y)){
		if(x==0 && y==0){  //暗坑
			printf("Yes\n");continue;
		}
		memset(vis,0,sizeof(vis));
		flag=true;
		mmin=NM;mmax=0;
		for(i=1;i<NM;i++) father[i]=i;
		if(x==-1 && y==-1) break;
		Union(x,y);vis[x]=vis[y]=1;
		if(mmin>x) mmin=x;if(mmin>y) mmin=y;
		if(mmax<x) mmax=x;if(mmax<y) mmax=y;
		
		while(1){
			scanf("%d%d",&x,&y);
			if(x==0 && y==0) break;
			Union(x,y);vis[x]=vis[y]=1;
		if(mmin>x) mmin=x;if(mmin>y) mmin=y;
		if(mmax<x) mmax=x;if(mmax<y) mmax=y;
		}

		u=Find(mmin);
		for(i=mmin+1;i<=mmax;i++){
			if(vis[i] && Find(i)!=u){
				flag=false;break;
			}
		}
		if(flag) printf("Yes\n");
		else printf("No\n");
	}
	return 0;
}