Uva 1292 - Strategic game 树形dp 最小点覆盖
来源:互联网 发布:大数据股票分析网站 编辑:程序博客网 时间:2024/04/30 07:56
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 file contains several data sets in text format. Each data set represents a tree with the following description:The node identifiers are integer numbers between 0 and n-1, for n nodes (0 < n ≤ 1500). Every edge appears only once in the input data.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)
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).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-------------
f[i][0]表示点i属于点覆盖,并且以点i为根的子树中所连接的边都被覆盖的情况下点覆盖集中所包含的最少点数。
f[i][1]表示点i不属于点覆盖,且以i为根的子树中所连接的边都被覆盖的情况下点覆盖集中所包含最少点的个数。
① f[i][0]=1+sum{ min(f[v][0], f[v][1]) };
② f[i][1]=sum{ f[v][0] };
-------------
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <cmath>using namespace std;const int maxn=3111;const int INF=1e9;struct EDGENODE{ int to,next;} edges[maxn];int head[maxn],edge;void addedge(int u,int v){ edges[edge].to=v,edges[edge].next=head[u],head[u]=edge++; edges[edge].to=u,edges[edge].next=head[v],head[v]=edge++;}void init_edges(){ memset(head,-1,sizeof(head)); edge=0;}int n;int f[maxn][2];void dp(int u,int pa){ f[u][0]=1; f[u][1]=0; for (int k=head[u]; k!=-1; k=edges[k].next) { int v=edges[k].to; if (v==pa) continue; dp(v,u); f[u][0]+=min(f[v][0],f[v][1]); f[u][1]+=f[v][0]; }}int main(){ while (~scanf("%d",&n)) { int u,v,t; init_edges(); for (int i=0; i<n; i++) { scanf("%d:(%d)",&u,&t); while (t--) { scanf("%d",&v); addedge(u,v); } } dp(0,-1); printf("%d\n",min(f[0][0],f[0][1])); } return 0;}
- Uva 1292 - Strategic game 树形dp 最小点覆盖
- POJ 1463 Strategic game 最小点覆盖,树形DP
- poj 1463 Strategic game(最小点覆盖树形DP)
- hdu1054 Strategic Game(最小覆盖点-树形dp)
- UVa 2038 - Strategic game(二分图最小顶点覆盖 or 树形DP)
- UVA1292-----Strategic game-----树形DP解决树上的最小点覆盖问题
- POJ 1463 Strategic game 最小点覆盖集(树形dp)
- hdu 1054 Strategic Game 树形dp基础题,树的最小点覆盖
- POJ 1463 Strategic game (树形dp 树的最小点覆盖 水)
- HDU 1054 Strategic Game(二分图最小点覆盖 或者 树形DP)
- POJ 1463 Strategic game (二分图最小覆盖点(匈牙利算法) 或 树形DP)
- UVa 1292 - Strategic game (树形dp)
- UVA 1292 - Strategic game(树形dp)
- uva 1292 - Strategic game(树形dp)
- UVa:1292 Strategic game(树形DP)
- UVA 1292-Strategic game(树形DP)
- UVA 1292 Strategic game(树形dp)
- POJ 1463 Strategic game (树形DP,放置点覆盖边)
- 图片 缩略 和 水印 以及 C#获取当前程序运行路径的方法集合
- RCP实用技巧
- Something you need to know about INITIALIZATION LISTS in Constructor of C++
- #if defined() 含义
- c# excel操作
- Uva 1292 - Strategic game 树形dp 最小点覆盖
- vs2008快捷键
- 多目录工程构建Makefile的编写
- C++模板的魅力和魔力
- 通讯与互联网行业软件项目运作的一些不同
- [java] jar 命令压缩和解压缩
- calloc和malloc
- TCP之send函数研究
- Oracle 11gR2 RAC Listener - 多端口多监听