Pagini recente » Cod sursa (job #981277) | Cod sursa (job #1102281) | Cod sursa (job #2225458) | Cod sursa (job #494065) | Cod sursa (job #2047790)
#include <fstream>
#include <vector>
using namespace std;
const int N = 100005;
ifstream f("cerere.in");
ofstream g("cerere.out");
int n,k;
int str[N];
int vect[N];
int rez[N];
vector <int> v[N];
bool viz[N];
void afisare(int x)
{
for(int i = 1; i<= k;i++)
{
g<<vect[i]<<" ";
}
g<<"|"<<str[x];
g<<"\n\n";
}
void dfs(int p)
{
viz[p] = 1;
k++;
vect[k] = p;
if(str[p] > 0)
{
//g<<k<<" "<<str[p]<<" "<<k-str[p]<<"\n";
rez[p] = rez[vect[k-str[p]]] + 1;
}
else
{
rez[p] = 0;
}
//afisare(p);
for(int i = 0; i < v[p].size(); i++)
{
if(viz[v[p][i]] == 0)
{
dfs(v[p][i]);
}
}
k--;
}
int main()
{
f>>n;
for(int i = 1; i <= n; i++)
{
f>>str[i];
}
for(int i = 1; i < n; i++)
{
int x,y;
f>>x>>y;
v[x].push_back(y);
}
dfs(1);
for(int i = 1; i<= n; i++)
{
g<<rez[i]<<" ";
}
f.close();
g.close();
return 0;
}