Pagini recente » Registru diplome | Cod sursa (job #1824207) | Cod sursa (job #1975743) | Cod sursa (job #228415) | Cod sursa (job #605799)
Cod sursa(job #605799)
#include <fstream>
#include <assert.h>
#include <vector>
#define NMax 100010
using namespace std;
const char IN[]="cerere.in",OUT[]="cerere.out";
ifstream fin(IN); ofstream fout(OUT);
int N,L;
int a[NMax] , T[NMax];
vector<int> ad[NMax] ;
int v[NMax];
void dfs(int x=1,int niv=0)
{
v[niv]=x;
if (a[x] && x!=1) T[x]=T[v[niv-a[x]]]+1;
for (int i=0;i<(int)ad[x].size();++i)
dfs(ad[x][i],niv+1);
v[niv]=0;
}
int main()
{
int i,x,y;
fin>>N;
for (i=1;i<=N;++i) fin>>a[i];
for (i=1;i<N;++i)
fin>>x>>y,
ad[x].push_back(y);
dfs();
/*for (i=1;i<=N;++i)
fout<<T[i]<<" ";
fout<<"\n";*/
return 0;
}