Pagini recente » Cod sursa (job #707078) | Cod sursa (job #2856495) | Cod sursa (job #1604435) | Cod sursa (job #862679) | Cod sursa (job #491063)
Cod sursa(job #491063)
#include<fstream>
#include<vector>
using namespace std;
ifstream f("asmax.in");
ofstream g("asmax.out");
int n,a[16001],maxim;
vector<int> v[160001];
int dfs(int k, int fost)
{
int i,s;
for(i=0;i<v[k].size();i++)
{
if(v[k][i]!=fost)
{
s=dfs(v[k][i],k);
if(s>=0)
a[k]+=s;
}
}
return a[k];
}
int main()
{
int i,x,y;
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<n;i++)
{
f>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
dfs(1,0);
for(i=1;i<=n;i++)
if(maxim<a[i])
maxim=a[i];
g<<maxim;
return 0;
}