Pagini recente » Cod sursa (job #2349534) | Cod sursa (job #1146448) | Cod sursa (job #2652809) | Cod sursa (job #622458) | Cod sursa (job #2448282)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("cerere.in");
ofstream fout("cerere.out");
struct nod{
vector<int> v;
int nr, k;
}g[100003];
int s[100001], vf=0, n;
void dfs(int x=1)
{
s[++vf]=x;
{
if(g[x].k) g[x].nr=g[s[vf-g[x].k]].nr+1;
for(int i=0;i<g[x].v.size();++i) dfs(g[x].v[i]);
}
vf--;
}
int main()
{
fin>>n;
for(int i=1;i<=n;++i)
{
fin>>g[i].k;
if(g[i].k==0) g[i].nr=0;
}
for(int i=2;i<=n;++i)
{
int x, y;
fin>>x>>y;
g[x].v.push_back(y);
}
dfs();
for(int i=1;i<=n;++i) fout<<g[i].nr<<" ";
fout<<"\n";
return 0;
}