UVA 539 The Settlers of Catan(回溯法)
来源:互联网 发布:非法经营期货软件投诉 编辑:程序博客网 时间:2024/06/05 11:28
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个点,分别为0~n-1,给你m条路径,求出其中最长的路径。
- UVA 539 The Settlers of Catan(回溯法)
- UVA 539 - The Settlers of Catan(深搜 回溯)
- UVA - 539 The Settlers of Catan (回溯水题)
- uva 539 The Settlers of Catan(回溯)
- The Settlers of Catan uva dfs+回溯
- UVa 539 - The Settlers of Catan, 简单回溯
- UVa 539 - The Settlers of Catan 递归回溯
- 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
- POJ 2318
- asp.net 创建procedure/function/trigger
- cas的几个误区
- android几个知识点总结(全屏显示,倒计时,页面切换动画效果,obtainmessage)
- 转载:2.5.5 AutoVacuum系统自动清理进程
- UVA 539 The Settlers of Catan(回溯法)
- iOS越狱程序开发(4)- 总结
- 编程珠玑第二章习题
- 转载:2.5.6 PgStat统计数据收集进程
- 排序
- 【§超玄跑车win7电脑主题下载§系统美化】
- 《算法竞赛-训练指南》第一章-1.26_LA 3882
- 转载:2.6 服务进程Postgres
- Java中的递归原理分析