Pagini recente » Cod sursa (job #904991) | Cod sursa (job #1356825) | Cod sursa (job #1737936) | Cod sursa (job #735330) | Cod sursa (job #2973146)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin ("cerere.in");
ofstream cout ("cerere.out");
const int N = 100000;
int help[N+1],n,timp[N+1];
vector <int> L[N+1];
vector <int> coada;
void afisare()
{
for (int i : coada)
cout << i << ' ';
cout << endl;
}
void dfs(int x)
{
coada.push_back(x);
if (help[x] == 0)
timp[x] = 0;
else
{
timp[x] = timp[coada[coada.size()-1-help[x]]] + 1;
}
for (int y : L[x])
{
dfs(y);
}
coada.pop_back();
}
int main()
{
int x,y;
cin >> n;
for (int i=1; i<=n; i++)
cin >> help[i];
for (int i=1; i<n; i++)
{
cin >> x >> y;
L[x].push_back(y);
}
dfs(1);
for (int i=1; i<=n; i++)
cout << timp[i] << ' ';
}