Pagini recente » Cod sursa (job #2849892) | Cod sursa (job #1574871) | Cod sursa (job #1567025) | Cod sursa (job #1772565) | Cod sursa (job #1791058)
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("stramosi.in");
ofstream g("stramosi.out");
int n,q,i,v[250001],log2[20],p,k,r[250001][20],p2,j;
inline void BuildRMQ()
{
int m=log2[n]+1,i,j;
for(i=1; i<=n; i++)
r[i][0]=v[i];
for(j=1; j<m; j++)
for(i=1; i<=n; i++)
r[i][j]=r[r[i][j-1]][j-1];
}
int main()
{
f>>n>>q;
for(i=1; i<=n; i++)
f>>v[i];
log2[1]=0;
for(i=2; i<=n; i++)
log2[i]=log2[i/2]+1;
BuildRMQ();
for(; q; q--)
{
f>>p>>k;//al k lea stramos al lui p
while(k && p)
{
p2=1;
for(j=0; p2*2<=k; ++j)
p2*=2;
p=r[p][j];
k-=p2;
}
g<<p<<'\n';
}
}