The Settlers of Catan uva dfs+回溯
来源:互联网 发布:应用双开软件下载 编辑:程序博客网 时间:2024/06/05 00:26
The Settlers of Catan
Within Settlers of Catan, the 1995 German game of the year, players attempt to dominate an islandby 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 ofthis 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 linearpath. Therefore, determining the longest road is not trivial (although human players usually see itimmediately).
Compared to the original game, we will solve a simplified problem here: You are given a set ofnodes (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 thenumber of edgesm (). The nextm lines describe the m edges. Each edge is given by thenumbers of the two nodes connected by it. Nodes are numbered from 0 ton-1. Edges areundirected. 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
解决方案:水题,dfs+回溯
代码:
#include<iostream>#include<cstdio>#include<cstring>using namespace std;int Map[30][30];int n,m,M;int dfs(int no,int sum){ if(sum>M) M=sum; for(int i=0;i<n;i++){ if(Map[no][i]){ Map[i][no]--; Map[no][i]--; dfs(i,sum+1); Map[i][no]++; Map[no][i]++; } } return M;}int main(){ while(~scanf("%d%d",&n,&m)&&(n+m)){ memset(Map,0,sizeof(Map)); for(int i=0;i<m;i++) { int a,b; scanf("%d%d",&a,&b); Map[a][b]++; Map[b][a]++; } int Max=0; for(int i=0;i<n;i++) { M=0; int temp=dfs(i,0); if(temp>Max) Max=temp; } cout<<Max<<endl; }return 0;}
- 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 The Settlers of Catan
- UVA 539 The Settlers of Catan dfs找最长链
- [回溯]The Settlers of Catan UVA539
- zju1947 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
- JAVA学习笔记(2)_____线程同步锁(synchronized)模拟火车售票窗口
- rational rose中对函数的形参设置
- 仿照移动端码表计时器开发的web版码表计时器
- 74LS183 加法器 【数字电路】
- 配置Nginx防止直接用IP访问Web服务器
- The Settlers of Catan uva dfs+回溯
- markdown--nodejs常用模块
- Java中try catch finally语句中含有return语句的执行情况(总结版)
- ImageMagick 组合图片和分割图片
- IBM Worklight 6.1 平台条件
- JavaScript函数调用规则
- JAVA学习笔记(3)_____线程同步锁(synchronized)简单的应用
- 向占位程序传送了空的索引指针
- C++学习第七天:vector容器(集合)