Pagini recente » Cod sursa (job #1550396) | Cod sursa (job #2738340) | Cod sursa (job #1677971) | Cod sursa (job #2486015) | Cod sursa (job #1829344)
#include<fstream>
using namespace std;
ifstream f("cerere.in");
ofstream g("cerere.out");
int vf[200001], lst[100001], pred[100001], urm[100001], v[100001], sol[100001], n, nr, pp;
bool viz[100001];
void adauga(int x, int y)
{
nr++;
vf[nr]=y;
urm[nr]=lst[x];
lst[x]=nr;
}
void dfs(int x)
{
viz[x]=true;
pred[pp]=x;
int poz=lst[x],y,i,k;
if(v[x]==0)
sol[x]=0;
else
{
k=x;
k=pred[pp-v[x]];
sol[x]=sol[k] + 1;
}
while(poz!=0)
{
y=vf[poz];
if(!viz[y])
{
pp++;
dfs(y);
pp--;
}
poz = urm[poz];
}
}
int main()
{
int i,j,x,y, k;
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n-1;i++)
{
f>>x>>y;
adauga(x,y);
}
for(i=1;i<=n;i++)
if(pred[i]==0)
{
pp=1;
dfs(i);
break;
}
for(i=1;i<=n;i++)
g<<sol[i]<<" ";
return 0;
}