Pagini recente » Cod sursa (job #2957976) | Cod sursa (job #268328) | Cod sursa (job #2047755) | Cod sursa (job #235573) | Cod sursa (job #2296306)
#include <fstream>
#include <vector>
using namespace std;
ifstream in("cerere.in");
ofstream out("cerere.out");
const int N=100001;
int v[N], d[N], cost[N], f[N];
vector <int> a[N];
int n;
void citire()
{
in>>n;
for(int i=1; i<=n; i++) in>>v[i];
for(int i=1; i<=n-1; i++)
{
int x, y;
in>>x>>y;
f[y]=1;
a[x].push_back(y);
}
}
int fnd()
{
for(int i=1; i<=n; i++)
if(f[i]==0) return i;
}
void defeseu(int x, int niv)
{
d[niv]=x;
cost[x]=1+cost[d[niv-v[x]]];
for(auto y:a[x]) defeseu(y,niv+1);
}
int main()
{
citire();
defeseu(fnd(), 1);
for(int i=1; i<=n; i++) out<<cost[i]-1<<" ";
return 0;
}