[USACO08JAN]手机网络Cell Phone Network

[USACO08JAN]手机网络Cell Phone Network

题目描述

Farmer John has decided to give each of his cows a cell phone in hopes to encourage their social interaction. This, however, requires him to set up cell phone towers on his N (1 ≤ N ≤ 10,000) pastures (conveniently numbered 1..N) so they can all communicate.

Exactly N-1 pairs of pastures are adjacent, and for any two pastures A and B (1 ≤ A ≤ N; 1 ≤ B ≤ N; A ≠ B) there is a sequence of adjacent pastures such that A is the first pasture in the sequence and B is the last. Farmer John can only place cell phone towers in the pastures, and each tower has enough range to provide service to the pasture it is on and all pastures adjacent to the pasture with the cell tower.

Help him determine the minimum number of towers he must install to provide cell phone service to each pasture.

John想让他的所有牛用上手机以便相互交流(也是醉了。。。)，他需要建立几座信号塔在N块草地中。已知与信号塔相邻的草地能收到信号。给你N-1个草地(A，B)的相邻关系，问：最少需要建多少个信号塔能实现所有草地都有信号。

输入输出格式

输入格式：

• Line 1: A single integer: N

• Lines 2..N: Each line specifies a pair of adjacent pastures with two space-separated integers: A and B

输出格式：

• Line 1: A single integer indicating the minimum number of towers to install

输入输出样例

输入样例1：

5
1 3
5 2
4 3
3 5

输出样例#1：

2

题解：
很经典的树形dp，状态为f[i][3]分别表示此节点不选且不能被覆盖，此节点选，此节点不选但能被覆盖三种情况，然后动规方程就很显然了。不过多概述，以下是AC代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<algorithm>
using namespace std;
int n,m;
int f[][];
struct student
{
    int next,to;
}edge[];
int head[],size;
void putin(int from,int to)
{
    size++;
    edge[size].next=head[from];
    edge[size].to=to;
    head[from]=size;
}
void dfs(int k,int father)
{
    int f0=,f2=,f1=,w=,i,s=;
    for(i=head[k];i!=-;i=edge[i].next)
    {
        int y=edge[i].to;
        if(y==father)continue;
        dfs(y,k);
        s=min(f[y][],f[y][]);
        w+=s;
        if(f[y][]-s<f0)f0=f[y][]-s;
        f1+=min(f[y][],min(f[y][],f[y][]));
        if(f2<)f2+=f[y][];
    }
    f[k][]=f1+;f[k][]=f2;
    if(f0==)f[k][]=;
    else f[k][]=w+f0;
}
int main()
{
    int i,j,from,to;
    cin>>n;
    for(i=;i<=n;i++)head[i]=-;
    for(i=;i<n;i++)
    {
        scanf("%d%d",&from,&to);
        putin(from,to);
        putin(to,from);
    }
    dfs(,);
    cout<<min(f[][],f[][]);
    return ;
}