Pagini recente » Cod sursa (job #3142721) | Cod sursa (job #128690) | Cod sursa (job #289497) | Monitorul de evaluare | Cod sursa (job #2144125)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("cerere.in");
ofstream out("cerere.out");
const int N=100001;
int t[N],v[N],rasp[N],n;
int cauta(int x)
{
if(v[x]==0)
return 0;
if(rasp[x]!=0)
return rasp[x];
int k,copie,cop;
copie=v[x];
cop=x;
while(copie>0)
{
k=t[cop];
copie--;
cop=k;
}
rasp[x]=1+cauta(k);
return rasp[x];
}
int main()
{
int x,y,i;
in>>n;
for(i=1;i<=n;i++)
in>>v[i];
for(i=1;i<n;i++)
{
in>>x>>y;
t[y]=x;
}
for(i=1;i<=n;i++)
out<<cauta(i)<<' ';
return 0;
}