Pagini recente » Monitorul de evaluare | Cod sursa (job #1736752) | Cod sursa (job #1040314) | Cod sursa (job #667556) | Cod sursa (job #2006974)
#include<fstream>
#include<vector>
using namespace std;
ifstream fi("asmax.in");
ofstream fo("asmax.out");
int rez,n,i,x,y,A[16001];
vector<int> V[16001];
int dfs(int nod, int p)
{
int sum=A[nod];
int it;
for(it=0; it<V[nod].size(); it++)
{
if(V[nod][it]!=p)
{
sum=sum+dfs(V[nod][it],nod);
}
}
rez=max(rez,sum);
return max(sum,0);
}
int main()
{
fi>>n;
for(i=1; i<=n; i++)
fi>>A[i];
for(i=1; i<n; i++)
{
fi>>x>>y;
V[x].push_back(y);
V[y].push_back(x);
}
rez=-1000000000;
dfs(1,0);
fo<<rez<<"\n";
fi.close();
fo.close();
return 0;
}