1021 Deepest Root (25 分)

#include
#include
#include
#include
#include
using namespace std;
vector v[10010],ans[10010];
set s;
int vis[10010],maxh;
void dfs(int x,int h){
	vis[x]=1;
	ans[h].push_back(x);
	maxh=max(maxh,h);
	for(int i=0;i>n;
	for(int i=1;i>x>>y;
		v[x].push_back(y);
		v[y].push_back(x);	
	}
	for(int i=1;i<=n;++i){
		if(vis[i]==0){
			dfs(i,1);
			ret++; 
		}
	}
	if(ret>1)
		printf("Error: %d components",ret);
	else{
		memset(vis,0,sizeof vis);
		for(int i=0;i::iterator it;
		for(it=s.begin();it!=s.end();++it)
        	cout<<*it< 
刷题日常