HDU 1054 最小顶点覆盖 (树形dp)
2016-02-28 13:11
465 查看
Problem 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 theminimum 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.
The input file 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_identifier
or
node_identifier:(0)
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.
For example for the tree:
the solution is one soldier ( at the node 1).
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 table:
Sample Input
4 0:(1) 1 1:(2) 2 3 2:(0) 3:(0) 5 3:(3) 1 4 2 1:(1) 0 2:(0) 0:(0) 4:(0)
Sample Output
1 2
dp
[0],dp
[1] 表示两种状态,因为前一种状态会影响到后一种的状态,so就用这种来表示,完美。
dp
[0]表示该点不取,固之前的点必须去,dp
[0]+=dp[son
][1];
dp
[1]表示该点取,so之前的点可取可不取,那么我们就取代价最小的累加,dp
[1]+=min(dp[son[]n][1],dp[son
][0]);
此处贴一下代码...
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<queue> #include<vector> using namespace std; const int N = 1500 + 100; vector<int>vv ; int fa ,dp [2]; void dfs(int root) { int i,j,len=vv[root].size(); for(i=0;i<len;i++) { dfs(vv[root][i]); dp[root][0]+=dp[vv[root][i]][1]; dp[root][1]+=min(dp[vv[root][i]][0],dp[vv[root][i]][1]); } } int main() { int n,i,j,root,m,u,v; while(scanf("%d",&n)!=EOF) { for(i=0;i<=n;i++) { fa[i]=i; dp[i][0]=0; dp[i][1]=1; vv[i].clear(); } for(i=1;i<=n;i++) { scanf("%d:(%d)",&root,&m); while(m--) { scanf("%d",&v); vv[root].push_back(v); fa[v]=root; } } root=1; while(fa[root]!=root) root=fa[root]; dfs(root); printf("%d\n",min(dp[root][0],dp[root][1])); } return 0; }
相关文章推荐
- iOS 在didSelectAnnotationView方法中获取标题和副标题
- [转载] TCP与UDP对比
- [唐德刚]——从北京政变到皇姑屯期间的奉张父子(亦可以之简理军阀混战史)
- 在.sln文件中设置Visual Studio默认启动项目的简单方法
- 大型网站架构系列:负载均衡详解(4)
- 【Manthan, Codefest 16A】【水题 暴力】Ebony and Ivory ax+by=z
- 京东左侧悬浮条设计
- APP短信注册流程
- Java中的this与super
- 线性表
- ubuntu中eclipse无法识别android手机问题
- 堆和栈区别 生长方向和存储方向
- LeetCode OJ 3.Longest Substring Without Repeating Characters
- 大型网站架构系列:负载均衡详解(3)
- Hadoop安装教4程_单机/伪分布式配置_Hadoop2.6.0/Ubuntu14.0
- 向上取整Ceil,向下取整Floor,四舍五入Round
- 【Codeforces Round 340 (Div 2)E】【莫队算法 真实区间思想】XOR and Favorite Number m组区间询问 问区间中多少连续段异或值为k
- linux内存管理之初始化zonelists
- LeetCode OJ 2.Add Two Numbers
- 优化sql语句执行效率的方法