UVa 539 - The Settlers of Catan 递归回溯
2014-03-14 18:45
411 查看
The Settlers of Catan |
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 ton-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 2 0 1 1 2 15 16 0 2 1 2 2 3 3 4 3 5 4 6 5 7 6 8 7 8 7 9 8 10 9 11 10 12 11 12 10 13 12 14 0 0
Sample Output
2 12
Miguel A. Revilla
1999-01-11
#include <iostream> #include <cstring> #include <cstdio> #include <algorithm> using namespace std; const int MAX=25+5; int map[MAX][MAX]; int vis[MAX][MAX]; int n, m; int ans=0; void init() { ans =0; memset(map, 0, sizeof(map)); memset(vis, 0, sizeof(vis)); } void read() { int u, v; for(int i=0; i < m; i++) { cin >> u >> v; map[u][v]=map[v][u]=1; } } void dfs(int u, int length) { if(length > ans) ans = length; for(int v=0; v < n; v++) { if(map[u][v] && !vis[u][v]) { vis[u][v]=vis[v][u]=1; length ++; dfs(v, length); length--; vis[u][v]=vis[v][u]=0; } } } void solve() { for(int i=0; i < n; i++) { dfs(i, 0); } cout << ans << endl; } // 一次AC 真舒服 int main() { // freopen("in.txt","r",stdin); while(1) { init(); cin >> n >> m; if(!n && !m) break; read(); solve(); } return 0; }
相关文章推荐
- UVa 539 - The Settlers of Catan, 简单回溯
- [回溯]The Settlers of Catan UVA539
- The Settlers of Catan(uva539简单的回溯)
- 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 dfs找最长链
- UVA 539 The Settlers of Catan(回溯法)
- UVA 539 - The Settlers of Catan
- UVA 539 The Settlers of Catan
- uva539 - 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
- The Settlers of Catan uva dfs+回溯
- UVA 539 - The Settlers of Catan