Pagini recente » Cod sursa (job #955977) | Cod sursa (job #1193102) | Cod sursa (job #1258971) | Cod sursa (job #95171) | Cod sursa (job #1266688)
#include <iostream>
#include <fstream>
#define maxN 350000
#define maxM 400000
using namespace std;
ifstream ji("stramosi.in");
ofstream jo("stramosi.out");
int n, m, v[maxN];
int main()
{
ji >> n >> m;
for (int i=1; i<=n; i++)
{
ji >> v[i];
cout << v[i] << "\t";
}
for (int pr=1; pr<=m; pr++)
{
int p, q, i, pasi;
bool bun=true;
ji >> q >> p;
if (p>q)
jo << 0 << "\n";
else if (p==1)
jo << v[q] << "\n";
else
{
i=1, pasi=1;
while (pasi!=p)
{
if (v[q-i]!=v[q-i+1])
pasi++;
i++;
}
jo << v[q-i+1] << "\n";
}
}
return 0;
}