【DFS】nyoj 20 吝啬的国度

http://acm.nyist.net/JudgeOnline/problem.php?pid=20

分析：从某点逆向开始搜寻，生成树

#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;

const int NM=100005;
int vis[NM],n;
vector<int>ve[NM];

void DFS(int s)
{
	for(int i=0;i<ve[s].size();i++){
		if(!vis[ve[s][i]]){
			vis[ve[s][i]]=s;
			DFS(ve[s][i]);
		}
	}	
}

int main()
{
	int T,i,x,y,s;
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d%d",&n,&s);
		memset(ve,0,sizeof(ve));
		for(i=0;i<n-1;i++){
			scanf("%d%d",&x,&y);
			ve[x].push_back(y);
			ve[y].push_back(x);
		}
		memset(vis,0,sizeof(vis));
		vis[s]=-1;
		DFS(s);
		for(i=1;i<n;i++)
		printf("%d ",vis[i]);
		printf("%d\n",vis[n]);
	}
	return 0;
}