Pagini recente » Cod sursa (job #1551846) | Cod sursa (job #1580008) | Cod sursa (job #657054) | Cod sursa (job #2065239) | Cod sursa (job #1154089)
#include <fstream>
#include <vector>
using namespace std;
int n,nr[100001],st[100001],sti,sol[100001];
bool r[100001];
vector<int> g[100001];
void dfs(int nod)
{
st[++sti]=nod;
if(nr[nod])
sol[nod]=sol[st[sti-nr[nod]]]+1;
for(size_t i=0;i<g[nod].size();++i)
dfs(g[nod][i]);
--sti;
}
ifstream fin("cerere.in");
ofstream fout("cerere.out");
int main()
{
int i,x,y;
fin>>n;
for(i=1;i<=n;++i)
fin>>nr[i];
for(i=1;i<n;++i)
{
fin>>x>>y;
g[x].push_back(y);
r[y]=1;
}
for(i=1;r[i];++i);
dfs(i);
for(i=1;i<=n;++i)
fout<<sol[i]<<" ";
return 0;
}