Pagini recente » Cod sursa (job #2610004) | Borderou de evaluare (job #3228889) | Cod sursa (job #2640623) | Cod sursa (job #2437605) | Cod sursa (job #3273127)
#include <fstream>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int n,m,q,p,putere,pow[250005],rmq[21][250005];
int main()
{
fin>>n>>m;
for(int i=1; i<=n; i++)
fin>>rmq[0][i];
///rmq[i][j] retine al i-lea stramos a lui j
for(int i=1; (1<<i)<=n; i++)
for(int j=1; j<=n; j++)
rmq[i][j]=rmq[i-1][rmq[i-1][j]]; ///rmq[j-1][i]=poz stramasoului
for(int i=2; i<=250000; i++)
pow[i]=pow[i/2]+1;
for(int i=1; i<=m; i++)
{
fin>>q>>p;
while(p)
{
putere=pow[p];
p-=(1<<putere);
}
fout<<rmq[putere][q]<<'\n';
}
return 0;
}