Pagini recente » Cod sursa (job #3270727) | Cod sursa (job #1814658) | Cod sursa (job #3178660) | Cod sursa (job #2510513) | Cod sursa (job #1902974)
#include <fstream>
#include <vector>
#define nmax 100000
using namespace std;
ifstream f("cerere.in");
ofstream g("cerere.out");
int n, tata[nmax],viz[nmax], m, sol[nmax], k[nmax], sap[nmax];
vector<int>v[nmax];
int l;
void dfs(int x)
{ int i;
sap[++l]=x;
if(k[x])
sol[x]=sol[sap[l-k[x]]]+1;
for(i=0;i<v[x].size();i++)
dfs(v[x][i]);
l--;
}
int main()
{
int x, y, i, j, ok;
f>>n;
for(i=1;i<=n;i++)
f>>k[i];
for(i=1;i<n;i++)
{ f>>x>>y;
tata[y]=1;
v[x].push_back(y);
}
for(i=1;i<=n;i++)
if(!tata[i])
break;
dfs(i);
for(i=1;i<=n;i++)
g<<sol[i]<<" ";
return 0;
}