UVA - 539 The Settlers of Catan
来源:互联网 发布:反曲弓 知乎 品牌 编辑:程序博客网 时间:2024/05/21 12:59
The Settlers of Catan
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 m lines 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; n 表示 n个城市 , m表示其中相连,
利用回溯,进行搜索;
#include <iostream>#include <cstdio>#include <cstring>using namespace std;#define N 30int n, m;int map[N][N];int vis[N][N];int Max;int x, y;void dfs(int i, int d) {for (int j = 0; j < n; j++) {if (!vis[i][j] && !vis[j][i] && map[i][j] && i != j) {vis[i][j] = vis[j][i] = 1;dfs(j,d+1);vis[i][j]= vis[j][i] = 0;}}if (d>Max) {Max = d;}}int main () {while (scanf("%d%d",&n,&m) != EOF) {if (n ==0 && m == 0) break;memset(map,0,sizeof(map));for (int i = 0; i < m; i++) {scanf("%d%d",&x,&y);map[x][y] = map [y][x] = 1;}Max = 0;for (int i = 0; i < n; i++) {memset(vis,0,sizeof(vis));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
- 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
- php web下订单编号的生成(隐藏订单上面的统计信息)
- 菜鸟学SSH(十八)——Hibernate动态模型+JRebel实现动态创建表
- SQL Server 2008中文版标准教程读书笔记 数据类型(复习SQL Server 二)
- android 文件存放路径
- 一片解决vi用法(整理)
- UVA - 539 The Settlers of Catan
- Hadoop-2.4.1学习之QJM HA的自动故障转移
- linux interface eth0 is disappeared
- 算法分析——N个苹果放在N个盘子里的问题
- Codeforces Round #274 (Div. 2) --C Exams
- IOS开发-KVO
- 数据库解析——MyISAM锁表机制1
- Zoho和Salesforce,谁是更适合中小企业的CRM软件?
- 解决 安装驱动程序后设备管理器中显示黄色问号