Pagini recente » Cod sursa (job #2255979) | Cod sursa (job #1127890) | Cod sursa (job #1621740) | Cod sursa (job #2266866) | Cod sursa (job #1567750)
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("stramosi.in");
ofstream g("stramosi.out");
int n,m,i,j,x,y,tata[250001];
int main()
{
f>>n>>m;
for(i=1;i<=n;++i)
{
f>>tata[i];
if(tata[i]==i-1)
++j;
}
if(j==n)
for(i=1;i<=m;++i)
{
f>>x>>y;
g<<max(x-y,0)<<"\n";
}
else
for(i=1;i<=m;++i)
{
f>>x>>y;
while(y&&x)
{
--y;
x=tata[x];
}
g<<x<<"\n";
}
return 0;
}