Pagini recente » Cod sursa (job #2409686) | Cod sursa (job #2101389) | Cod sursa (job #2802157) | Cod sursa (job #81634) | Cod sursa (job #562526)
Cod sursa(job #562526)
#include<stdio.h>
#include<vector>
using namespace std;
FILE*f=fopen("cerere.in","r");
FILE*g=fopen("cerere.out","w");
vector <int> v[100001];
int sol[100001],k,n,x,y,w[100001],j,s[100001],i;
char viz[100001];
void count(){
i=0;
while(w[s[j]]){
j-=w[s[j]];
i++;
}
sol[k]=i;
}
void dfs(int nod,int niv){
viz[nod]=1;
s[niv]=nod;
for(int i=0;i<v[nod].size();++i)
if(viz[v[nod][i]]==0)
dfs(v[nod][i],niv+1);
j=niv;
k=nod;
count();
}
int main() {
fscanf(f,"%d",&n);
for(i=1;i<=n;++i)
fscanf(f,"%d",&w[i]);
for(i=1;i<n;++i){
fscanf(f,"%d%d",&x,&y);
v[x].push_back (y);
}
dfs(1,1);
for(i=1;i<=n;++i)
fprintf(g,"%d ",sol[i]);
fclose(g);
fclose(f);
return 0;
}