Cell Phone Network

https://ac.nowcoder.com/acm/contest/1069/A 

总结：树形dp；dp[u][0]表当前节点u建站点最少数目；dp[u][1]表示u的子节点有建，u不建；dp[u][2]表示u能被父节点覆盖，不建； 

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <map>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%lld",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

/*
//---------------------------------------------------------
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace __gnu_pbds;
*/

//gp_hash_table<string,int>mp2;
//__gnu_pbds::priority_queue<int>q;//因为放置和std重复，故需要带上命名空间
//__gnu_pbds::priority_queue<int,greater<int>,pairing_heap_tag> pq;//最快
//----------------------------------------------------------


/*
//----------------------------------------------------------
const int BufferSize = 1 << 16;
char buffer[BufferSize], *_head, *_tail;
inline char Getchar() {
    if (_head == _tail) {
        int l = fread(buffer, 1, BufferSize, stdin);
        _tail = (_head = buffer) + l;
    }
    return *_head++;
 }
inline int read() {
    int x = 0, f = 1;char c = Getchar();
    for (;!isdigit(c);c = Getchar()) if (c == '-') f = -1;
    for (;isdigit(c);c = Getchar()) x = x * 10 + c - '0';
    return x * f;
 }
//----------------------------------------------------------
*/


const int maxn=5e5+9;
const int maxm=4e5+9;
const int mod=1e9+7;

struct E
{
    int to,nex;
}edge[maxn<<1];
int head[maxn];
int tot;

bool vis[maxn];

void addedge(int u,int v)
{
    edge[tot].to=v;
    edge[tot].nex=head[u];
    head[u]=tot++;
}

int dp[maxn][3];
void init()
{
    mem(head,-1);
    tot=0;
    mem(dp,0);
    mem(vis,0);
}


void dfs(int u)
{
    dp[u][0]=1;
    dp[u][1]=dp[u][2]=0;

    vis[u]=1;

    int Min=INF;
    bool f=1;
    for(int i=head[u];i!=-1;i=edge[i].nex)
    {
        int v=edge[i].to;
        if(vis[v]) continue;

        dfs(v);

        dp[u][0]+=min(dp[v][0],min(dp[v][1],dp[v][2]));

        dp[u][2]+=min(dp[v][0],dp[v][1]);

        if(dp[v][0]<=dp[v][1])
        {
            f=0;
            dp[u][1]+=dp[v][0];
        }
        else
        {
            dp[u][1]+=dp[v][1];
            Min=min(dp[v][0]-dp[v][1],Min);
        }
    }
    if(f) dp[u][1]+=Min;
}

int n,m;
int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    cin>>n;
    init();
    for(int i=0;i<n-1;i++)
    {
        int a,b;
        cin>>a>>b;
        addedge(a,b);
        addedge(b,a);
    }

    dfs(1);

    printf("%d\n",min(dp[1][0],dp[1][1]));

    return 0;
}