原文链接:https://www.luogu.com.cn/problem/P1122
AC代码:
#include<iostream>
#include<string.h>
#include<vector>
#include<math.h>
#include<algorithm>
using namespace std;
#define ll long long
int maxn=0;
int n;
vector<int> vec;
int dp[16005];
int head[16005],cnt=0,visit[16005];
typedef struct edged{
int fr,to,next;
}edged;
edged edge[32005];
void add(int u,int v){
edge[cnt].fr=u;
edge[cnt].to=v;
edge[cnt].next=head[u];
head[u]=cnt;
cnt++;
}
void dfs(int pre,int now){
int i,j;
//cout<<pre<<" "<<now<<endl;
dp[now]=vec[now-1];
maxn=max(maxn,dp[now]);
for(i=head[now];i!=-1;i=edge[i].next){
int e=edge[i].to;
if(visit[e]==1) continue;
visit[now]=1;
//pre=now;now=e;错误写法
dfs(now,e);
dp[now]=max(dp[now],dp[e]+dp[now]);
maxn=max(maxn,dp[now]);
//cout<<now<<" "<<e<<" "<<dp[now]<<endl;
}
}
int main(){
int i,j;
memset(head,-1,sizeof(head));
memset(dp,0,sizeof(dp));
memset(visit,0,sizeof(visit));
cin>>n;
for(i=0;i<n;i++){
cin>>j;
vec.push_back(j);
}
for(i=0;i<n-1;i++){
int p,q;
cin>>p>>q;
add(p,q);
add(q,p);
}
dfs(1,1);
cout<<maxn;
return 0;
}