Pagini recente » Cod sursa (job #3180917) | Cod sursa (job #1099379) | Cod sursa (job #56868) | Cod sursa (job #2504184) | Cod sursa (job #1408601)
#include <fstream>
using namespace std;
ifstream ka("stramosi.in");
ofstream ki("stramosi.out");
const int N_MAX = 250000;
const int LOG_MAX = 17;
int stramos[N_MAX + 1][LOG_MAX + 1], log[N_MAX + 1];
int n, m, p, q, f;
int main()
{
ka >> n >> m;
for(int i = 2; i <= n; i++)
log[i] = log[i / 2] + 1;
for(int i = 1; i <= n; i++)
ka >> stramos[i][0];
for(int j = 1; j <= log[n]; j++)
for(int i = 1; i <= n; i++)
stramos[i][j] = stramos[stramos[i][j-1]][j-1];
for(int i = 1; i <= m; i++)
{
ka >> q >> p;
int l;
while(p)
{
l = log[p];
q = stramos[q][l];
p -= (1 << l);
}
ki << q << '\n';
}
}