Pagini recente » Cod sursa (job #2027109) | Cod sursa (job #1485388) | Cod sursa (job #3186531) | Cod sursa (job #906863) | Cod sursa (job #3239967)
#include <bits/stdc++.h>
#define VMAX 100
#define NMAX 16000
#define LOG 21
#define INF (int)(10e8)
#define MOD 1000000007
#define ll long long int
#define NIL 0
using namespace std;
ifstream fin("asmax.in");
ofstream fout("asmax.out");
vector<int> adj[NMAX+1];
int v[NMAX+1],dp[NMAX+1];
int n;
void dfs(int x,int t)
{
int smax=v[x];
for(int i : adj[x])
{
if(i!=t)
{
dfs(i,x);
smax += max(dp[i],0);
}
}
dp[x]=smax;
}
int main()
{
fin >> n;
for(int i=1;i<=n;i++)
{
fin >> v[i];
}
for(int i=1;i<=n-1;i++)
{
int x,y;
fin >> x >> y;
adj[x].push_back(y);
adj[y].push_back(x);
}
dfs(1,0);
int res = -INF;
for(int i=1;i<=n;i++)
{
res=max(res,dp[i]);
}
fout << res;
}