2019牛客国庆集训派对day6 J Defense Tower （树形dp/贪心 思维）

题目链接：https://ac.nowcoder.com/acm/contest/1111/J
占坑有空补详解

代码

#include<bits/stdc++.h>
using namespace std;
#define maxn 100005
#define maxm 5000006
#define ll long long int
#define INF 0x3f3f3f3f
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,r,l) for(int i=r;i>=l;i--)
#define mem(a) memset(a,0,sizeof(a))
#define sqr(x) (x*x)
#define inf (ll)2e18+1
#define mod 7
int read(){
    int x=0,f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
     while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
     return f*x;
}
int n,a[maxn];
vector<int>e[maxn];
ll dp[maxn];
void dfs(int x,int y){
    dp[x]=0;
    for(int i=0;i<e[x].size();i++){
        int v=e[x][i];
        if(v==y)continue;
        dfs(v,x);
        dp[x]+=dp[v]+min(a[x],a[v]);
    }
}
int main()
{
    while(~scanf("%d",&n)){
        int x,y;
        inc(i,1,n)a[i]=read();
        inc(i,1,n-1){
            x=read();y=read();
            e[x].push_back(y);e[y].push_back(x);
        }
        dfs(1,0);
        printf("%lld\n",dp[1]);
        inc(i,0,n){
            dp[i]=0;
            e[i].clear();
        }
    }
    return 0;
}