Pagini recente » Cod sursa (job #3257121) | Cod sursa (job #538721) | Cod sursa (job #2921182) | Cod sursa (job #739236) | Cod sursa (job #2916419)
#include <fstream>
#include <vector>
#include <algorithm>
#define NMAX 100010
using namespace std;
ifstream fin ("cerere.in");
ofstream fout ("cerere.out");
int n;
int nrstramos[NMAX];
int tata[NMAX];
int main()
{
fin>>n;
for(int i=1; i<=n; i++)
fin>>nrstramos[i];
int x, y;
for(int i=1; i<=n-1; i++)
{
fin>>x>>y;
tata[y]=x;
}
for(int i=1; i<=n; i++)
{
int nr=0, x=i;///x este maimuta care rezolva prob
while(nrstramos[x]!=0)
{
nr++;
int aux=nrstramos[x];
while(aux)
{x=tata[x]; aux--;}
}
fout<<nr<<" ";
}
return 0;
}