Pagini recente » Cod sursa (job #2241430) | Cod sursa (job #566143) | Cod sursa (job #1859274) | avram_iancu_9 | Cod sursa (job #2125080)
#include <fstream>
#include <vector>
#define nmax 100005
using namespace std;
fstream f1("cerere.in", ios::in);
fstream f2("cerere.out", ios::out);
int n, k[nmax], t[nmax], rad, viz[nmax], g[nmax], stiva[nmax], vf;
vector <int> v[nmax];
void citire()
{
int i, x, y;
f1>>n;
for(i=1; i<=n; i++)
f1>>k[i];
for(i=1; i<n; i++)
{
f1>>x>>y;
t[y]=x;
v[x].push_back(y);
}
for(i=1; i<=n; i++)
if(t[i]==0) {rad=i; break;}
}
void dfs()
{
int nod;
vector <int> :: iterator it;
while(vf!=0)
{
nod=stiva[vf];
for(it=v[nod].begin(); (it!=v[nod].end())&&(viz[*it]); ++it);
if(it==v[nod].end()) vf--;///te intorci recursiv
else
{
vf++;
stiva[vf]=*it;
viz[*it]=1;
g[*it]=g[stiva[vf- k[*it]]]+1;
}
}
}
void afisare()
{
int i;
for(i=1; i<=n; i++)
f2<<g[i]-1<<' ';
}
int main()
{
citire();
vf=1;
stiva[vf]=rad;
viz[rad]=1;
g[rad]=1;
dfs();
afisare();
return 0;
}