Pagini recente » Cod sursa (job #2574461) | Cod sursa (job #2210970) | Cod sursa (job #1147609) | Cod sursa (job #2652829) | Cod sursa (job #1268695)
#include <fstream>
#include <vector>
using namespace std;
ifstream is("cerere.in");
ofstream os("cerere.out");
vector<int> t;
vector<int> salt;
vector<int> dist;
int n;
int aux1, aux2;
int Jump(int x);
int main()
{
is >> n;
t.resize(n+1);
dist.resize(n+1);
for(int i = 1; i <= n; ++i)
{
is >> aux1;
salt.push_back(aux1);
}
for(int i = 1; i <= n - 1; ++i)
{
is >> aux1;
is >> aux2;
t[aux2] = aux1;
}
for(int i = 1; i <= n; ++i)
{
dist[i] = Jump(i);
os << dist[i] << ' ';
}
is.close();
os.close();
return 0;
}
int Jump(int x)
{
if(dist[x] != 0)
return dist[x];
int cnt = salt[x-1];
if(cnt == 0)
return 0;
while(cnt >= 1)
{
x = t[x];
cnt--;
}
return Jump(x) + 1;
}