Pagini recente » Cod sursa (job #2043975) | Cod sursa (job #3169239) | Cod sursa (job #1294050) | Cod sursa (job #902343) | Cod sursa (job #831295)
Cod sursa(job #831295)
#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;
vector <int> l[16001];
int viz[16001],f[16001];
int dfs(int u)
{
int s=0,t;
vector<int>::iterator it;
viz[u]=1;
s+=f[u];
for(it=l[u].begin();it!=l[u].end();++it)
if(!viz[*it])
{
t=dfs(*it);
if(t>0)
s+=t;
}
return s;
}
int main()
{
freopen("asmax.in","r",stdin);
freopen("asmax.out","w",stdout);
int n,i,max=0;
scanf("%d",&n);
for(i=1;i<=n;++i)
scanf("%d",&f[i]);
int u,v;
for(i=1;i<n;++i)
{
scanf("%d%d",&u,&v);
l[u].push_back(v);
l[v].push_back(u);
}
int t;
for(i=1;i<=n;++i)
{
memset(viz,0,sizeof(viz));
t=dfs(i);
if(t>max)
max=t;
}
printf("%d\n",max);
return 0;
}