The Settlers of Catan POJ
来源:互联网 发布:银联数据应届生待遇 编辑:程序博客网 时间:2024/05/22 16:53
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.
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
Sample Output
2
12
求一张图里的最长路径,图的初步认识。每个点为起点遍历即可
#include <stdio.h>#include <string.h>int tmp,res;struct node{ int s,e; node(int ss=-1,int ee=-1):s(ss),e(ee){}}ma[60];int fst[30],bro[60],vis[30][30];void dfs(int i){ int j,a,b; if(tmp>res) res=tmp; for(j=fst[i];j!=-1;j=bro[j]){ a=ma[j].s;b=ma[j].e; if(vis[a][b]||vis[b][a]) continue; vis[a][b]=1;vis[b][a]=1; tmp++; dfs(b); tmp--; vis[a][b]=0;vis[b][a]=0; } return ;}int main(){ int n,m,a,b,i,j,k; while((scanf("%d %d",&n,&m))!=EOF){ if(n==0&&m==0) return 0; memset(fst,-1,sizeof(fst)); memset(bro,-1,sizeof(fst)); for(i=0;i<30;i++){ for(j=0;j<30;j++){ vis[i][j]=0; } } j=1; for(i=1;i<=m;i++){ scanf("%d %d",&a,&b); ma[j]=node(a,b);bro[j]=fst[a];fst[a]=j;j++; ma[j]=node(b,a);bro[j]=fst[b];fst[b]=j;j++; } res=0; for(i=0;i<n;i++){ tmp=0; dfs(i); } printf("%d\n",res); } return 0;}
- The Settlers of Catan POJ
- The Settlers of Catan
- 539--The Settlers of Catan
- 539The Settlers of Catan
- 539 - The Settlers of Catan
- uva539 - The Settlers of Catan
- UVaOJ539 - The Settlers of Catan
- UVA539- The Settlers of Catan
- UVA657- The Settlers of Catan
- 539 - The Settlers of Catan
- UVA The Settlers of Catan
- UVa 539 & POJ 2258 - The Settlers of Catan
- poj 2258 The Settlers of Catan(边的搜索)
- poj 3849 Settlers of Catan 模拟
- zju1947 The Settlers of Catan (DFS)
- UVa 539 The Settlers of Catan
- Uva 539 The Settlers of Catan
- uva 539 - The Settlers of Catan
- 17/10/15
- Django 使用MySQL
- while和do while
- ssh
- 684. Redundant Connection(第6周作业重做,麻烦重新批改下)
- The Settlers of Catan POJ
- js滑动加载
- 模板全特化与偏特化
- 《Java核心技术 卷I》笔记 第二章 Java程序设计环境
- mysql 5.7.19安装
- CS231N-11-Other Computer Vision Tasks
- extends作业三
- 用__dict__列出实例属性的通用工具
- IO多路复用之select