POJ1947:Rebuilding Roads(树形DP)
来源:互联网 发布:iphone7蜂窝移动数据 编辑:程序博客网 时间:2024/05/10 07:53
Description
The cows have reconstructed Farmer John's farm, with its N barns (1 <= N <= 150, number 1..N) after the terrible earthquake last May. The cows didn't have time to rebuild any extra roads, so now there is exactly one way to get from any given barn to any other barn. Thus, the farm transportation system can be represented as a tree.
Farmer John wants to know how much damage another earthquake could do. He wants to know the minimum number of roads whose destruction would isolate a subtree of exactly P (1 <= P <= N) barns from the rest of the barns.
Farmer John wants to know how much damage another earthquake could do. He wants to know the minimum number of roads whose destruction would isolate a subtree of exactly P (1 <= P <= N) barns from the rest of the barns.
Input
* Line 1: Two integers, N and P
* Lines 2..N: N-1 lines, each with two integers I and J. Node I is node J's parent in the tree of roads.
* Lines 2..N: N-1 lines, each with two integers I and J. Node I is node J's parent in the tree of roads.
Output
A single line containing the integer that is the minimum number of roads that need to be destroyed for a subtree of P nodes to be isolated.
Sample Input
11 61 21 31 41 52 62 72 84 94 104 11
Sample Output
2
Hint
[A subtree with nodes (1, 2, 3, 6, 7, 8) will become isolated if roads 1-4 and 1-5 are destroyed.]
题意:给出n,p,一共有n个节点,要求最少减去最少的边是多少,剩下p个节点
思路:典型的树形DP,
dp[s][i]:记录s结点,要得到一棵j个节点的子树去掉的最少边数
考虑其儿子k
1)如果不去掉k子树,则
dp[s][i] = min(dp[s][j]+dp[k][i-j]) 0 <= j <= i
2)如果去掉k子树,则
dp[s][i] = dp[s][i]+1
总的为
dp[s][i] = min (min(dp[s][j]+dp[k][i-j]) , dp[s][i]+1 )
#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;int n,p,root;int dp[155][155];int father[155],son[155],brother[155];void dfs(int root){ int i,j,k,tem; for(i = 0; i<=p; i++) dp[root][i] = 10000000; dp[root][1] = 0; k = son[root]; while(k) { dfs(k); for(i = p; i>=1; i--) { tem = dp[root][i]+1; for(j = 1; j<i; j++) tem = min(tem,dp[k][i-j]+dp[root][j]); dp[root][i] = tem; } k = brother[k]; }}int solve(){ int ans,i; dfs(root); ans = dp[root][p]; for(i = 1; i<=n; i++)//除了根节点,其他节点要想成为独立的跟,必先与父节点断绝关系,所以要先加1 ans = min(ans,dp[i][p]+1); return ans;}int main(){ int i,x,y; while(~scanf("%d%d",&n,&p)) { memset(father,0,sizeof(father)); memset(son,0,sizeof(son)); for(i = 1; i<n; i++) { scanf("%d%d",&x,&y); father[y] = 1;//记录该点有父亲节点 brother[y] = son[x];//记录兄弟节点 son[x] = y;//记录子节点 } for(i = 1; i<=n; i++) { if(!father[i])//找到根节点 { root = i; break; } } printf("%d\n",solve()); } return 0;}
- POJ1947 Rebuilding Roads 树形DP
- POJ1947:Rebuilding Roads(树形DP)
- POJ1947:Rebuilding Roads(树形DP)
- poj1947 Rebuilding Roads 树形dp
- poj1947 Rebuilding Roads--树形dp
- POJ1947 Rebuilding Roads 树形DP
- POJ1947 Rebuilding Roads【树形DP】
- 树形DP(4) Poj1947 Rebuilding Roads
- poj1947 Rebuilding Roads 树形dp背包
- 树形DP(Rebuilding Roads poj1947)
- POJ1947---Rebuilding Roads(树形dp,背包)
- poj1947 Rebuilding Roads 树形dp 背包
- poj1947 Rebuilding Roads 树形背包
- 【POJ1947】Rebuilding Roads,树形DP(本文分组背包做法)
- POJ1947 Rebuilding Roads(树状DP)
- poj1947--Rebuilding Roads(树状dp)
- Rebuilding Roads--树形DP
- Rebuilding Roads(POJ1947)树状dp
- Struts2标签
- Apache防DDOS模块mod_evasive的安装配置和使用
- linux下 php安装AMQP扩展 与AMQP收发消息
- 黑马程序员-面向对象(下)--内部类和异常
- Android Manifest配置文件
- POJ1947:Rebuilding Roads(树形DP)
- hdu4336 Card Collector (容斥原理)
- Linux调试器工作原理之三——调试信息
- Sql Server 中的字符串拆分函数
- android 源代码反编译教程
- Android 线程池管理
- Linux特性集锦
- libIconv.lib编码库的生成和使用(2)
- 在可编辑表格EditorGrid中,我选择一行已输入的数据,点击删除按钮,该行数据将被删除,然后当我点击表单提交按钮时,已经被删除的那一行数据仍然被插入数据库中