HDU1054 树状DP

Strategic Game

Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1287    Accepted Submission(s): 521

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

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.

设 dpnode[i] 为节点 i 放一士兵的时候看守以 i 为根的子树的最少士兵数 ,dpall[i] 为看守以节点 i 为根的子树需要的最少士兵数 ( 不包括 i).

状态转移方程 :

当 i 为叶子节点时 :

dpnode[i]=1;

dpall[i]=0;

当 i 为非叶子节点时 :

dpnode[i]=sum(dpall[j])  (j 为 i 的儿子节点 )

dpall[i]=min(dpnode[i],1+sum(dpall[j]))  (j 为 i 的儿子节点 )

 

代码如下 :

#include<stdio.h> #include<string.h> #define MAXN 1505 struct Node { int s; Node *next; }head[MAXN]; int dpall[MAXN],dpnode[MAXN]; inline int min (int a,int b) { return a<b?a:b; } void DP(int node) { int sumall=0,sumnode=0; Node *p; p=head[node].next; if (p == NULL) { dpnode[node]=1; dpall[node]=0; } else { while (p!=NULL) { DP(p->s); sumall+=dpall[p->s]; sumnode+=dpnode[p->s]; p=p->next; } dpnode[node]=1+sumall; dpall[node]=min(dpnode[node],sumnode); } } int main() { Node *s; int p[MAXN]; int i,j,n,m,nod,son,deal[MAXN],t,sum; while (scanf("%d",&n)!=EOF) { for (i=0;i<=n;++i) head[i].next=NULL; for (i=0;i<=n;++i) p[i]=i; for (i=1;i<=n;++i) { scanf("%d:(%d)",&nod,&m); for (j=1;j<=m;++j) { scanf("%d",&son); p[son]=nod; s=new Node; s->s=son; s->next=head[nod].next; head[nod].next=s; } } t=sum=0; for (i=0;i<n;++i) if (p[i] == i) {deal[++t]=i;} for (i=1;i<=t;++i) { DP(deal[i]); sum+=dpall[deal[i]]; } printf("%d/n",sum); } return 0; }