Pagini recente » Cod sursa (job #1688406) | Cod sursa (job #329106) | Cod sursa (job #4717) | Cod sursa (job #2652109) | Cod sursa (job #2280188)
#include <fstream>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
const int NMax = 250000;
int TT[NMax + 5];
int N,M;
void Read()
{
fin >> N >> M;
for(int i = 1; i <= N; ++i)
fin >> TT[i];
}
int Ancestor(int Q, int P)
{
while(P)
{
Q = TT[Q];
P--;
}
return Q;
}
void SolveAndPrint()
{
while(M--)
{
int Q,P;
fin >> Q >> P;
fout << Ancestor(Q,P) << "\n";
}
}
int main()
{
Read();
SolveAndPrint();
return 0;
}