Pagini recente » Cod sursa (job #3244388) | Cod sursa (job #2832171) | Cod sursa (job #3254524) | Cod sursa (job #2308550) | Cod sursa (job #175008)
Cod sursa(job #175008)
#include <fstream.h>
#define N 16001
ifstream fin("asmax.in");
ofstream fout("asmax.out");
int v[N],n,viz[N],tati[N],radacina,fii[N][N],nrf[N];
long long s[N];
void citire()
{
fin>>n;
int i;
for(i=1;i<=n;i++)
{
fin>>v[i];
tati[i]=0;
nrf[i]=0;
}
int a,b;
for(i=1;i<n;i++)
{
fin>>a>>b;
nrf[a]++;
fii[a][nrf[a]]=b;
tati[b]=a;
s[i]=0;
}
for(i=1;i<=n;i++)
if(tati[i]==0)
{
radacina=i;
break;
}
}
int max(int a,int b)
{
if(a>b) return a;
return b;
}
void progdin(int nod)
{
int i;
if(nrf[nod]>=1)
for(i=1;i<=nrf[nod];i++)
progdin(fii[nod][i]);
s[nod]=v[nod];
if (nrf[nod]!=0)
for(i=1;i<=nrf[nod];i++)
s[nod]=max(s[nod],s[nod]+s[i]);
}
int main()
{
int max,i,j;
citire();
progdin(radacina);
max=s[1];
for(i=2;i<=n;i++)
if (max<=s[i])
max=s[i];
fout<<max<<'\n';
return 0;
}