Pagini recente » Cod sursa (job #1335843) | Cod sursa (job #1860144) | Cod sursa (job #1839964) | Cod sursa (job #2481644) | Cod sursa (job #1994848)
#include <iostream>
#include <cstdio>
using namespace std;
int n,m,t[250001],p,q,i,j;
int main()
{
freopen("stramosi.in","r",stdin);
freopen("stramosi.out","w",stdout);
scanf("%d%d",&n,&m);
for(i=1;i<=n;++i) { scanf("%d",&t[i]);
if(t[i]==i-1) j++;}
if(j==n)
for(i=1;i<=m;++i)
{
scanf("%d%d", &q, &p);
printf("%d\n",max(q-p,0));
}
else
for(i=1;i<=m;++i)
{
scanf("%d%d", &q, &p);
for(j=1;j<=p;j++) q=t[q];
printf("%d\n",q);
}
return 0;
}