Pagini recente » Cod sursa (job #638749) | Cod sursa (job #1718406) | Cod sursa (job #2904051) | Cod sursa (job #1723406) | Cod sursa (job #1235618)
#include <iostream>
#include <fstream>
using namespace std;
ifstream ka("stramosi.in");
ofstream ki("stramosi.out");
const int N_MAX = 250000;
const int LOG_MAX = 18;
int stramos[N_MAX + 1][LOG_MAX + 1];
int srch(int p, int q)
{
for(int i = 18; i >= 0; i--)
if(p & (1 << i))
{
q = stramos[q][i];
}
return q;
}
string s;
int n, m, p, q, k;
int main()
{
ka >> n >> m;
for(int i = 1; i <= n; i++)
ka >> stramos[i][0];
for(int j = 1; j <= LOG_MAX; j++)
for(int i = 1; i <= n; i++)
stramos[i][j] = stramos[stramos[i][j-1]][j-1];
while(m--)
{
ka >> q >> p;
ki << srch(p, q) << '\n';
}
}