UVA 539-The Settlers of Catan(dfs)
来源:互联网 发布:java面试框架问题 编辑:程序博客网 时间:2024/06/09 18:06
Description
Within Settlers of Catan, the 1995 German game of the year, players attempt to dominate an island by building roads, settlements and cities across its uncharted wilderness.
You are employed by a software company that just has decided to develop a computer version of this game, and you are chosen to implement one of the game's special rules:
When the game ends, the player who built the longest road gains two extra victory points.
The problem here is that the players usually build complex road networks and not just one linear path. Therefore, determining the longest road is not trivial (although human players usually see it immediately).
Compared to the original game, we will solve a simplified problem here: You are given a set of nodes (cities) and a set of edges (road segments) of length 1 connecting the nodes. The longest road is defined as the longest path within the network that doesn't use an edge twice. Nodes may be visited more than once, though.
Example: The following network contains a road of length 12.
o o -- o o \ / \ / o -- o o -- o / \ / \o o -- o o -- o \ / o -- o
Input
The input file will contain one or more test cases.The first line of each test case contains two integers: the number of nodes n ( ) and the number of edges m ( ). The next mlines describe the m edges. Each edge is given by the numbers of the two nodes connected by it. Nodes are numbered from 0 to n-1. Edges are undirected. Nodes have degrees of three or less. The network is not neccessarily connected.
Input will be terminated by two values of 0 for n and m.
Output
For each test case, print the length of the longest road on a single line.Sample Input
3 20 11 215 160 21 22 33 43 54 65 76 87 87 98 109 1110 1211 1210 1312 140 0
Sample Output
212
题意:有n个点m条边构成的无向无环图,求这个图最长的一条边。
思路:以每个点为顶点,深搜。
#include <stdio.h>#include <math.h>#include <string.h>#include <stdlib.h>#include <iostream>#include <algorithm>#include <set>#include <queue>#include <stack>#include <map>using namespace std;typedef long long LL;int n,m;int maxx;int mp[30][30];int vis[30][30];void dfs(int u,int cnt){ int i; if(maxx<cnt) maxx=cnt; for(i=0; i<n; i++) { if(!vis[u][i]&&!vis[i][u]&&mp[u][i]) { vis[u][i]=vis[i][u]=1; dfs(i,cnt+1); vis[u][i]=vis[i][u]=0;//防止对后来的造成影响 } }}int main(){ int i; int u,v; while(~scanf("%d %d",&n,&m)) { if(!n&&!m) break; memset(mp,0,sizeof(mp)); for(i=0; i<m; ++i) { scanf("%d %d",&u,&v); mp[u][v]=mp[v][u]=1; } maxx=0; for(i=0; i<n; i++) { memset(vis,0,sizeof(vis)); dfs(i,0); } printf("%d\n",maxx); } return 0;}
- UVA 539-The Settlers of Catan(dfs)
- The Settlers of Catan uva dfs+回溯
- UVA 539 The Settlers of Catan dfs找最长链
- UVa - 539 - The Settlers of Catan ( DFS 回溯 )
- 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
- JAVA 异常
- 前端笔试题目练习笔记:统计数组中不同的数字出现的概率并排序
- Java反射入门
- JAVA Static类
- 2015年Java笔试题--那些头疼的智力题
- UVA 539-The Settlers of Catan(dfs)
- Win8.1更新之后没法启动,如何修复?
- Android 之 TranslateAnimation类:位移动画类
- 总结之linux下网络编程
- 关于c++中的类继承以及类初始化顺序
- 13 layers hardwood core dynea brown film faced plywood
- Android学习——ListView的使用
- lucene3.6.1 经典案例 入门教程
- 文件处理工具类