Pagini recente » Cod sursa (job #879869) | Cod sursa (job #1663281) | Cod sursa (job #605896) | Cod sursa (job #366889) | Cod sursa (job #2001288)
#include <cstdio>
#include <vector>
using namespace std;
const int NMAX = 100005;
bool vf[NMAX];
int k[NMAX], sol[NMAX];
vector <int> v[NMAX];
vector <int> s;
void dfs(int poz)
{
s.push_back(poz);
if(k[poz]) {
sol[poz] = sol[s[s.size() - k[poz] - 1]] + 1;
}
else {
sol[poz] = 0;
}
for(auto i : v[poz]) {
dfs(i);
}
s.pop_back();
}
int main()
{
int n, i, a, b, poz;
freopen("cerere.in","r",stdin);
freopen("cerere.out","w",stdout);
scanf("%d", &n);
for(i = 1;i <= n; ++i) {
scanf("%d", &k[i]);
}
for(i = 1;i < n; ++i) {
scanf("%d%d", &a, &b);
v[a].push_back(b);
vf[b] = 1;
}
for(i = 1;i <= n; ++i) {
if(vf[i] == 0) {
poz = i;
}
}
dfs(poz);
for(i = 1;i <= n; ++i) {
printf("%d ", sol[i]);
}
printf("\n");
return 0;
}