Pagini recente » Cod sursa (job #475695) | Borderou de evaluare (job #2005094) | Borderou de evaluare (job #201310) | Cod sursa (job #348699) | Cod sursa (job #310266)
Cod sursa(job #310266)
//#include<algorithm>
//using namespace std;
#include<stdio.h>
#define DIM 250001
int n,m,p,q,val,a[DIM];
void calc(int x,int y){
if(x==p||!a[y]){
val=y;
return;}
else
calc(x+1,a[y]);}
void solve(){
int i;
scanf("%d%d",&n,&m);
for(i=1; i<=n; ++i)
scanf("%d",&a[i]);
for(i=0; i<m; ++i){
scanf("%d%d",&q,&p);
calc(1,q);
printf("%d\n",a[val]);}}
int main(){
freopen("stramosi.in","r",stdin);
freopen("stramosi.out","w",stdout);
solve();
return 0;}