POJ1694,An Old Stone Game,读懂题目+dfs
来源:互联网 发布:淘宝网儿童棉服 编辑:程序博客网 时间:2024/04/30 15:29
An Old Stone Game
Description
There is an old stone game, played on an arbitrary general tree T. The goal is to put one stone on the root of T observing the following rules:
At the beginning of the game, the player picks K stones and puts them all in one bucket.
At each step of the game, the player can pick one stone from the bucket and put it on any empty leaf.
When all of the r immediate children of a node p each has one stone, the player may remove all of these r stones, and put one of the stones on p. The other r - 1 stones are put back into the bucket, and can be used in the later steps of the game.
The player wins the game if by following the above rules, he succeeds to put one stone on the root of the tree.
You are to write a program to determine the least number of stones to be picked at the beginning of the game (K), so that the player can win the game on the given input tree.
Input
The input describes several trees. The first line of this file is M, the number of trees (1 <= M <= 10). Description of these M trees comes next in the file. Each tree has N < 200 nodes, labeled 1, 2, ... N, and each node can have any possible number of children. Root has label 1. Description of each tree starts with N in a separate line. The following N lines describe the children of all nodes in order of their labels. Each line starts with a number p (1 <= p <= N, the label of one of the nodes), r the number of the immediate children of p, and then the labels of these r children.
Output
One line for each input tree showing the minimum number of stones to be picked in step 1 above, in order to win the game on that input tree.
Sample Input
2
7
1 2 2 3
2 2 5 4
3 2 6 7
4 0
5 0
6 0
7 0
12
1 3 2 3 4
2 0
3 2 5 6
4 3 7 8 9
5 3 10 11 12
6 0
7 0
8 0
9 0
10 0
11 0
12 0
Sample Output
3
4
分析:
题目不难理解,关键是采用的存储结构,以及dfs的遍历方式。
这里用一个二维数组tree来存储。第i行输入tree[i]中。考虑填充每一个节点需要的石子数,存到数组num[i]中,对num[i]排序,num[i]+i的最大值就是所求结果。
code:
#include<iostream>#include<cstdio>#include<algorithm>using namespace std;int tree[200+5][200+5];bool cmp(int a,int b){ return a>b;}int dfs(int index){ int num[205],max,i; if(!tree[index][0]) return 1; else { for(i=1;i<=tree[index][0];i++) num[i-1]=dfs(tree[index][i]); sort(num,num+tree[index][0],cmp ); for(i=0,max=-1;i<tree[index][0];++i) if(max<num[i]+i) max=num[i]+i; return max; }}int main(){ int m,n,i,j,p; scanf("%d",&m); while(m--) { memset(tree,0,sizeof(tree)); scanf("%d",&n); for(i=1;i<=n;i++) { scanf("%d %d",&p,&tree[i][0]); for(j=1;j<=tree[i][0];j++) scanf("%d",&tree[i][j]); } printf("%d\n",dfs(1)); }}
- POJ1694,An Old Stone Game,读懂题目+dfs
- POJ1694 An Old Stone Game
- POJ1694 An Old Stone Game (树,排序) .
- ZOJ1427 POJ1694 An Old Stone Game
- An Old Stone Game(poj1694模拟与排序)
- 1694 An Old Stone Game
- POJ 1694 An Old Stone Game
- POJ 1694 An Old Stone Game
- POJ--1694--An Old Stone Game
- An old Stone Game ~~GarsiaWachs算法
- poj 1694 An old stone game
- 北大oj 1694 An Old Stone Game
- POJ 1694 An Old Stone Game 笔记
- POJ 1738 An old Stone Game 笔记
- POJ 1694 An Old Stone Game【递归+排序】
- poj1738 An old Stone Game 石子合并(归并) GarsiaWachs算法
- poj1738 An old Stone Game 石子合并(归并) GarsiaWachs算法
- poj 1694 An Old Stone Game 树形dp
- Spring基础之一:第一个Spring
- 如果我们真的分手了:最新网友原创伤感空间日志
- 李开复的时间管理建议
- 天天记录 - Eclipse导入Android 4.1.2源码工程
- POJ1423,Big Number,同hdu1018
- POJ1694,An Old Stone Game,读懂题目+dfs
- 看谭浩强C++的感想
- 谢谢你,勾引我老公!这文章看得心酸
- 从非Exchange 系统迁移邮件数据到Exchange Server!
- hdu 2846 字典树
- 性能改善的一种模式
- 诺基亚中国市场严重衰退销量剧减64%
- EffectiveC++ Item12
- 繁体字非主流伤感日志_親愛的,為什麼