Pagini recente » Cod sursa (job #2901072) | Cod sursa (job #1502326) | Cod sursa (job #167448) | Cod sursa (job #3258333) | Cod sursa (job #2511696)
#include <cstdio>
using namespace std;
const int NMAX = 250000;
int t[NMAX + 5] , d[18][NMAX + 5] , n;
inline void dinamica()
{
int i , j;
for(j = 1 ; j <= n ; ++ j)
d[0][j] = t[j];
for(i = 1 ; (1 << i) <= n ; ++ i)
for(j = n ; j - (1 << i) >= 1 ; -- j)
d[i][j] = d[i - 1][d[i - 1][j]];
}
inline int query(int x , int y)
{
int j = 0;
for( ; y ; y = (y >> 1))
{
if(y & 1)
x = d[j][x];
++ j;
}
return x;
}
int main()
{
freopen("stramosi.in" , "r" , stdin);
freopen("stramosi.out" , "w" , stdout);
int q , i , x , y;
scanf("%d%d" , &n , &q);
for(i = 1 ; i <= n ; ++ i)
scanf("%d" , &t[i]);
dinamica();
for(i = 1 ; i <= q ; ++ i)
{
scanf("%d%d" , &x , &y);
printf("%d\n" , query(x , y));
}
return 0;
}