Pagini recente » Autentificare | Diferente pentru utilizator/hutanu_andrei intre reviziile 21 si 42 | Monitorul de evaluare | Diferente pentru utilizator/mihaipriboi intre reviziile 31 si 30 | Cod sursa (job #1036285)
#include<stdio.h>
#include<vector>
using namespace std;
vector<int > a[16004];
int n,i,sum[16004],viz[16004],s,maxim;
void parc(int k)
{
viz[k]=1;
for(int i=0;i<a[k].size();i++)
{
if(viz[a[k][i]]==0)
{
parc(a[k][i]);
if(sum[a[k][i]]>0)
{
sum[k]+=sum[a[k][i]];
//printf("%d %d %d\n",sum[k],a[k][i],sum[a[k][i]]);
}
}
}
if(sum[k]>maxim)
maxim=sum[k];
}
char c;
int main()
{
int x,y,x1,y1;
freopen("asmax.in","r",stdin);
freopen("asmax.out","w",stdout);
scanf("%d",&n);
maxim=-1000;
for(i=1;i<=n;i++){
scanf("%d",&sum[i]);
if(sum[i]>maxim)
maxim=sum[i];
}
// c=2;
x1=y1=-1;
while(scanf("%d%d ",&x,&y)!=EOF)
{
a[x].push_back(y);
a[y].push_back(x);
}
parc(1);
printf("%d",maxim);
return 0;
}