uva 539 The Settlers of Catan
2015-01-30 11:37
471 查看
求最大长度,刚开始没有用use数组,和两个数组遍历,超时。网上查了一下用数组,再改成一个循环遍历过去就好了。
</pre><pre code_snippet_id="593301" snippet_file_name="blog_20150130_3_6482174" name="code" class="cpp">
#include "stdio.h" #include<string.h> int city[30][30],max,n,m,use[30][30]; //city保存输入的连接关系,use 0为走过,1走过,max最大长度 void dfs(int y,int cnt) { int i,j; if(cnt>max) max=cnt; for(j=0; j<n; j++) { if(city[y][j]&&!use[y][j])//判断是否可以走 { use[y][j]=use[j][y]=1; dfs(j,cnt+1); use[y][j]=use[j][y]=0; } } } int main() { int i,j,a,b; while(~scanf("%d%d",&n,&m)) { if(n==0&&m==0) break; memset(city,0,sizeof(city)); memset(use,0,sizeof(use)); max=0; for(i=0; i<m; i++) { scanf("%d%d",&a,&b); city[a][b]=city[b][a]=1; } for(i=0; i<m; i++) dfs(i,0); printf("%d\n",max); } return 0; }
相关文章推荐
- UVa 539 - The Settlers of Catan
- Uva 539 - The Settlers of Catan
- UVa 539 - The Settlers of Catan
- UVA 539 The Settlers of Catan
- UVA 539 - The Settlers of Catan 解题报告
- UVA539- The Settlers of Catan
- uva 539 - The Settlers of Catan
- UVa 539 - The Settlers of Catan, 简单回溯
- UVA 539 The Settlers of Catan(图的搜索)
- UVA 539 The Settlers of Catan
- UVA 539 The Settlers of Catan
- uva 539 - The Settlers of Catan
- UVA 539 - The Settlers of Catan
- uva 539 - The Settlers of Catan
- UVA 539 - The Settlers of Catan
- UVa 539 - The Settlers of Catan
- uva 539 The Settlers of Catan
- UVA 539 - The Settlers of Catan(深搜 回溯)
- UVA 539 The Settlers of Catan(回溯法)
- uva 539 The Settlers of Catan