# poj 1463 Strategic game (树形DP）

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
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

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

<span style="color:#ff6666;">题意：给出一棵树，要求找到最少放几个士兵才能将所有点都看守到，每个节点的士兵只能看守临近一个的节点</span>

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct node{
int now,next;
}str[3005];
int root,len;
{
str[len].now=y;
str[len].now=x;
}
void dfs(int rt)
{
vis[rt]=1;
dp[rt][1]=1;
dp[rt][0]=0;
{
int k=str[i].now;
if(!vis[k])
{
dfs(k);
dp[rt][0]+=dp[k][1];
dp[rt][1]+=min(dp[k][1],dp[k][0]);
}
}
}
int main()
{
int t;
while(~scanf("%d",&t))
{
memset(dp,0,sizeof(dp));
memset(vis,0,sizeof(vis));
root=-1;
len=0;
for(int i=1;i<=t;i++)
{
int x,n;
scanf("%d:(%d)",&x,&n);
if(root==-1)
root=x;
for(int j=1;j<=n;j++)
{
int y;
scanf("%d",&y);
}
}
dfs(root);
printf("%d\n",min(dp[root][0],dp[root][1]));
}
}

• 本文已收录于以下专栏：

## POJ1463->树形DP

//树形DP //树的最小点覆盖 //f[x][1]以x为根的子树在x上放置的士兵的最少所需的士兵数目 //f[x][0]以x为根的子树x上不放置的士兵的最少所需的士兵数目 //状态转移方程： //如...
• SelinaFelton
• 2016年07月10日 16:56
• 343

## POJ 1463 Strategic game (树形DP) 解题报告

• u011941656
• 2014年08月20日 22:25
• 270

## 树形DP专辑--POJ 1463 Strategic game

Strategic game Time Limit: 2000MS   Memory Limit: 10000K Total Submissions: 5737   Accepted: 2...
• u012350533
• 2013年10月07日 00:20
• 672

## POJ 1463 Strategic game 最小点覆盖，树形DP

/* 应该是一道最小点覆盖问题，可以拆点用二分图做 这里用树形DP来解决 对叶子结点i，显然：dp[i][0]=0,dp[i][1]=1 否则，dp[i][0]=sum(dp[j][1],j为i的...
• wsniyufang
• 2011年07月28日 21:27
• 800

## poj 1463 Strategic game（最小点覆盖树形DP）

• u013903504
• 2014年09月02日 15:53
• 432

## poj 1463 Strategic game 树形dp

• qq_34494458
• 2016年08月16日 18:31
• 137

## poj 1463 Strategic game （树形dp 守卫）

Bob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solu...
• Littlewhite520
• 2017年04月27日 01:09
• 171

## poj 1463 Strategic game 树形dp

• zhoutonglx
• 2015年09月10日 18:37
• 219

## poj 1463 Strategic game(树形dp)

poj 1463 Strategic game
• PKU_ZZY
• 2016年07月19日 20:25
• 182

## POJ - 1463 Strategic game（树形DP）

Strategic game Description Bob enjoys playing computer games, especially strategic games, ...
• lzc504603913
• 2017年10月09日 19:13
• 43

举报原因： 您举报文章：poj 1463 Strategic game (树形DP） 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)