Pagini recente » Cod sursa (job #2770843) | Profil FlorinHaja | Cod sursa (job #2004074) | Cod sursa (job #679540) | Cod sursa (job #175033)
Cod sursa(job #175033)
#include <fstream.h>
#define N 16001
ifstream fin("asmax.in");
ofstream fout("asmax.out");
struct nod {int info;nod *urm;};
int v[N],n,tati[N],radacina,nrf[N];
nod *fii[N],*q,*p;
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;
q=new nod;
q->info=b;
q->urm=fii[a];
fii[a]=q;
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)
{
p=fii[nod];
int i;
while(p)
{
progdin(p->info);
p=p->urm;
}
p=fii[nod];
s[nod]=v[nod];
while(p)
{
s[nod]=max(s[nod],s[nod]+s[p->info]);
p=p->urm;
}
}
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;
}