树形dp入门题目
来源:互联网 发布:小企业电脑记账软件 编辑:程序博客网 时间:2024/05/16 01:58
Strategic game
Time Limit:2000MS Memory Limit:65536K
Total Submit:33 Accepted:15
Description
Bob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and then he is very sad. Now he has the following problem. He must defend a medieval city, the roads of which form a tree. He has to put the minimum number of soldiers on the nodes so that they can observe all the edges. Can you help him?
Your program should find the minimum number of soldiers that Bob has to put for a given tree.
For example for the tree:
the solution is one soldier ( at the node 1).
Input
The input contains several data sets in text format. Each data set represents a tree with the following description:
- the number of nodes
- the description of each node in the following format
node_identifier:(number_of_roads) node_identifier1 node_identifier2 ... node_identifiernumber_of_roads
or
node_identifier:(0)
The node identifiers are integer numbers between 0 and n-1, for n nodes (0 < n <= 1500);the number_of_roads in each line of input will no more than 10. Every edge appears only once in the input data.
Output
The output should be printed on the standard output. For each given input data set, print one integer number in a single line that gives the result (the minimum number of soldiers). An example is given in the following:
Sample Input
40:(1) 11:(2) 2 32:(0)3:(0)53:(3) 1 4 21:(1) 02:(0)0:(0)4:(0)
Sample Output
12
Source
Southeastern Europe 2000
其实也可以用最小点覆盖来做,都很简单啦~
ans[i][0]表示在不选择节点i的情况下,以i为根节点的子树,最少需要选择的点数;
ans[i][1]表示在选择节点i的情况下,以i为根节点的子树,最少需要选择的点数;
当i是叶子时,ans[i][0]=0,ans[i][1]=1;
else
ans[i][0]=sigma(ans[j][1])(j为i的子节点)
ans[i][1]=1+sigmamin(ans[j][0],ans[j][1]);
#include<stdio.h>
#include<string.h>
#define min(a,b) a<b?a:b
int ans[1505][2];
int child[1505];
int pos[1505];
struct EDGE{
int from,to;
}edge[1505];
void treedp(int st)
{
int to;
ans[st][0]=0;ans[st][1]=1;
if(child[st]==0) return ;
int i=pos[st];
while(edge[i].from==st)
{
to=edge[i++].to;
treedp(to);
ans[st][1]+=min(ans[to][0],ans[to][1]);
ans[st][0]+=ans[to][1];
}
}
int main()
{
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
int tot;
int i,j,s,t,sum,num,leve;
while(~scanf("%d",&tot))
{
int count=1;
sum=leve=0;
for(i=1;i<=tot;i++)
{
scanf("%d:(%d)",&s,&num);
sum+=s;
pos[s]=count;
child[s]=num;
for(j=1;j<=num;j++)
{
scanf("%d",&t);
leve+=t;
edge[count].from=s;
edge[count++].to=t;
}
}
int root=sum-leve;
treedp(root);
printf("%d\n",min(ans[root][0],ans[root][1]));
}
return 0;
}
- 树形dp入门题目
- 树形DP 题目
- POJ 2342 Anniversary Party题解 - 树形DP入门题目
- 【DP】树形DP题目总结
- 树形DP 入门
- 树形DP入门
- 树形DP入门
- hdu1561树形DP入门
- 树形DP 入门资料
- Ural1039 (树形dp入门)
- 树形dp入门
- 树形DP入门
- 树形DP入门总结
- 树形DP入门
- poj2342 树形dp入门
- 树形dp 入门
- 树形DP入门
- 树形DP入门
- 视频: 日本超酷的超导磁场赛道演示
- 食物链总结
- 霍夫曼树的应用
- dp 有一些细节要注意
- 状态压缩dp入门题
- 树形dp入门题目
- Matrix Chain Multiplication 模拟栈
- stars 第一个树状数组,水过~
- 树状数组的离散化 Ultra-QuickSort
- Color the ball 树状数组水之
- poj 1656
- 继续二维树状数组 pku1195
- hdu 1698 线段树 just a “trick” *_*
- I Hate It