【LCA+树形DP】POJ 3417

参考了该blog的思路http://www.cppblog.com/Yuan/archive/2010/07/11/120101.html，orz...........

#define N 100010
struct edge{
    int v;
    int len;
    int next;
}e[2*N];
int ecnt;
int head[N];
bool vis[N];
int n;
int R[N];
int p[N*2];
int dep[2*N];
int dp[20][2*N];
int num;
void init(){
    memset(head,-1,sizeof(head));
    memset(R,-1,sizeof(R));
    memset(vis,0,sizeof(vis));
    for(int i=1;i<=n;i++)fa[i] = i;
    ecnt=0;
}
void add(int u,int v){
    e[ecnt].v = v;
    e[ecnt].next = head[u];
    head[u] = ecnt++;

    e[ecnt].v = u;
    e[ecnt].next = head[v];
    head[v] = ecnt++;
}
void dfs(int u,int depth){
    vis[u] = 1;
    p[++num] = u;
    dep[num] = depth;
    for(int i=head[u];i!=-1;i=e[i].next){
        int v = e[i].v;
        if(!vis[v]){
            dfs(v,depth+1);
            p[++num] = u;
            dep[num] = depth;
        }
    }
}
void init_rmq(){
    int i,j;
    for(i=1;i<=num;i++){
        if(R[p[i]] == -1){
            R[p[i]] = i;
        }
    }
    for(i=1;i<=num;i++){
        dp[0][i] = i;
    }
    int t = (int)(log(num*1.0)/log(2.0));
    for(i=1;i<=t;i++){
        for(j=1;j+(1<<(i-1))<=num;j++){
            int a = dp[i-1][j],b = dp[i-1][j+(1<<(i-1))];
            if(dep[a]<=dep[b]){
                dp[i][j] = a;
            } else dp[i][j] = b;
        }
    }
}
int rmq(int u,int v){
    if(R[u]>=R[v])swap(u,v);
    int s = R[u],t = R[v];
    int k = (int)(log((t-s+1)*1.0)/log(2.0));
    int a = dp[k][s],b = dp[k][t-(1<<k)+1];
    if(dep[a]<=dep[b])return p[a];
    else return p[b];
}
int dp1[N];//i结点的父边被环覆盖数
void DP(int u,int fa){//统计环上其他的边的覆盖数
    for(int i=head[u];i!=-1;i=e[i].next){
        int v = e[i].v;
        if(v == fa)continue;
        DP(v,u);
        dp1[u]+=dp1[v];
    }
}
int main(){
    int m;
    while(scanf("%d%d",&n,&m) != -1){
        int i,j;
        init();
        for(i=1;i<n;i++){
            int a,b;
            scanf("%d%d",&a,&b);
            add(a,b);
        }
        memset(dp1,0,sizeof(dp1));
        num = 0;
        dep[1] = 0;
        dfs(1,0);
        init_rmq();
        for(i=0;i<m;i++){
            int a,b;
            scanf("%d%d",&a,&b);
            dp1[a]++,dp1[b]++;
            int fa = rmq(a,b);
            dp1[fa] -= 2;//LCA(a,b)的父边是不在环上的，每次引进新边(a,b)，dp[LCA[a,b]]-=2
        }
        DP(1,1);
        int ans=0;
        for(i=2;i<=n;i++){
            if(dp1[i] == 0)ans+=m;
            if(dp1[i] == 1)ans++;
        }
        printf("%d\n",ans);
    }
    return 0;
}