> #include <iostream>
> #include <list>
> 
> using namespace std;
> 
> typedef struct vertc
> {
> 	int dest;
> 	int visit;
> }vert;
> 
> typedef list<vert> vlist;
> typedef vlist::iterator vptr;
> 
> void dfs(vlist *nodes, int nr)
> {
> 	for(vptr itr = nodes[nr].begin(); itr != nodes[nr].end(); itr ++)
> 	{
> 		if( itr->visit ) continue;
> 		itr->visit = 1;
> 		dfs(nodes, itr->dest);
> 	}
> 	printf("%d\n", nr + 1);
> }
> 
> int main()
> {
> 	int m,n,a,b,i;
> 	vert nvt;
> 	vlist *nodes;
> 
> 	scanf("%d%d", &n, &m);
> 	nodes = new vlist[n];
> 	nvt.visit = 0;
> 	for(i = 0; i < m; i ++)
> 	{
> 		scanf("%d%d", &a, &b);
> 		a--, b--;
> 		nvt.dest = b;
> 		nodes[a].push_back(nvt);
> 		nvt.dest = a;
> 		nodes[b].push_back(nvt);
> 	}
> 	dfs(nodes, 0);
> 	delete []nodes;
> 
> 	return 0;
> }

• Re:我感觉是这样：TLE是list太慢了，用vector可以过；RE是因为dfs超栈，G++的栈VC的小(refer to faq) (37) dirtysalt 2009-07-28 09:57:27