The Settlers of Catan(回溯)

转载 2018年04月16日 21:42:23

The Settlers of Catan

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 will contain one or more test cases. 
The first line of each test case contains two integers: the number of nodes n (2<=n<=25) and the number of edges m (1<=m<=25). 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 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
#include<cstdio>  
#include<cstring>  
using namespace std;  
int n,m,s;  
int map[26][26],vis[26][26];  
int dfs(int x,int st)  
{  
    int i,j;  
    if(st>s) s=st;  
    for(i=0;i<n;i++)  
    {  
        if(map[x][i]&&!vis[x][i])  
        {  
            vis[x][i]=vis[i][x]=1;  
            dfs(i,st+1);  
            vis[x][i]=vis[i][x]=0;  
        }  
    }  
    return s;  
}  
int main()  
{  
    int i,j,a,b,t;  
    while(scanf("%d%d",&n,&m),n||m)  
    {  
        s=0;  
        memset(map,0,sizeof map);  
        memset(vis,0,sizeof vis);  
        for(i=1;i<=m;i++)  
        {  
            scanf("%d%d",&a,&b);  
            map[a][b]=map[b][a]=1;  
        }  
        for(j=0;j<n;j++)  
        {  
            dfs(j,0);  
        }  
        printf("%d\n",s);  
    }  
    return 0;  
}  

poj 2258 The Settlers of Catan(边的搜索)

The Settlers of Catan Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 1...
  • hexianhao
  • hexianhao
  • 2016-08-08 15:15:17
  • 479

[回溯]The Settlers of Catan UVA539

回溯求图中最长的路径。
  • u011194165
  • u011194165
  • 2013-11-15 10:03:56
  • 1049

The Settlers of Catan uva dfs+回溯

The Settlers of Catan  Within Settlers of Catan, the 1995 German game of the year, player...
  • u012870383
  • u012870383
  • 2014-06-01 10:43:15
  • 427

The Settlers of Catan(uva539简单的回溯)

题意:求无向图的最长链,点可以重复,边不可以重复 思路:暴力解决 每个点都有可能变成起始点,所以用每个点都暴力找到每个点的所有能走的路,用visit[i][j]保存走过的边,如果边没走过,就走,否...
  • leonharetd
  • leonharetd
  • 2013-11-28 09:16:51
  • 566

uva 539 The Settlers of Catan(回溯)

uva 539 The Settlers of Catan Within Settlers of Catan, the 1995 German game of the year, players...
  • llx523113241
  • llx523113241
  • 2015-01-29 11:12:14
  • 451

The Settlers of Catan

Description Within Settlers of Catan, the 1995 German game of the year, players attempt to domi...
  • u013776243
  • u013776243
  • 2014-07-06 19:38:55
  • 227

UVA - 539 The Settlers of Catan (回溯水题)

The Settlers of Catan  Within Settlers of Catan, the 1995 German game of the year, player...
  • HelloWorld10086
  • HelloWorld10086
  • 2014-08-12 14:06:06
  • 413

UVa 539 - The Settlers of Catan 递归回溯

The Settlers of Catan  Within Settlers of Catan, the 1995 German game of the year, player...
  • q745401990
  • q745401990
  • 2014-03-14 18:45:12
  • 992

UVA 539 - The Settlers of Catan(深搜 回溯)

The Settlers of Catan  Within Settlers of Catan, the 1995 German game of the year, pl...
  • coco430
  • coco430
  • 2013-08-09 15:05:42
  • 433

UVa - 539 - The Settlers of Catan ( DFS 回溯 )

Within Settlers of Catan, the 1995 German game of the year, players attempt to dominate an island by...
  • qq_34594236
  • qq_34594236
  • 2016-12-14 14:25:16
  • 383
收藏助手
不良信息举报
您举报文章:The Settlers of Catan(回溯)
举报原因:
原因补充:

(最多只允许输入30个字)