Pagini recente » Cod sursa (job #1973638) | Cod sursa (job #2681413) | Cod sursa (job #16590) | Cod sursa (job #1673174) | Cod sursa (job #2140492)
#include <cstdio>
#include <iostream>
#include <vector>
#define INF 1000000000
#define MAXN 16001
using namespace std;
vector <int> v[MAXN];
int d[MAXN];
bool viz[MAXN];
void dfs(int nod)
{
viz[nod]=true;
for(unsigned int i=0;i<v[nod].size();i++)
if(!viz[v[nod][i]])
{
dfs(v[nod][i]);
if(d[v[nod][i]]>0)
d[nod]+=d[v[nod][i]];
}
}
int main()
{
FILE *fin,*fout;
fin=fopen("asmax.in","r");
fout=fopen("asmax.out","w");
int n,x,y,maxim=-INF;
fscanf(fin,"%d",&n);
for(int i=1;i<=n;i++)
fscanf(fin,"%d",&d[i]);
for(int i=1;i<n;i++)
{
fscanf(fin,"%d%d",&x,&y);
v[x].push_back(y);
v[y].push_back(x);
}
dfs(1);
for(int i=1;i<=n;i++)
maxim=max(maxim,d[i]);
fprintf(fout,"%d",maxim);
fclose(fin);
fclose(fout);
return 0;
}