Pagini recente » Diferente pentru implica-te/arhiva-educationala intre reviziile 125 si 223 | Cod sursa (job #2317606) | Cod sursa (job #2322582) | Cod sursa (job #3259885) | Cod sursa (job #3264816)
#include <bits/stdc++.h>
#define cin ci
#define cout co
using namespace std;
ifstream cin("cerere.in");
ofstream cout("cerere.out");
int n, x, y;
vector<int> str, ans, gr, viz, nodes;
vector<vector<int>> graf;
void dfs(int node, int height)
{
viz[node] = 1;
nodes.push_back(node);
ans[node] = ans[nodes[height - str[node]]] + 1;
for(auto next:graf[node])
if(!viz[next])
dfs(next, height + 1);
nodes.pop_back();
}
int main()
{
cin >> n;
graf.assign(n+1, vector<int>());
str.resize(n+1);
ans.resize(n+1);
gr.resize(n+1);
viz.resize(n+1);
for(int i=1; i<=n; i++)
cin >> str[i];
for(int i=1; i<n; i++)
{
cin >> x >> y;
graf[x].push_back(y);
graf[y].push_back(x);
gr[y]++;
}
for(int i=1; i<=n; i++)
if(gr[i] == 0)
dfs(i, 0);
for(int i=1; i<=n; i++)
cout << ans[i] - 1 << " ";
return 0;
}