Pagini recente » Cod sursa (job #2314748) | Cod sursa (job #2799647) | Cod sursa (job #1143726) | Cod sursa (job #582944) | Cod sursa (job #1709650)
#include<vector>
#include<fstream>
using namespace std;
int main(){
int a[100001];
int v[100001];
int n, i, j,q;
ifstream fin("pq.in");
ofstream fout("pq.out");
fin >> n>>q;
for (i = 1; i <= n; ++i)
fin >> a[i];
for (i = 1; i < n; ++i)
{
bool ok = 0;
for (j = i + 1; j <= n && !ok; ++j)
if (a[i] == a[j])
{
v[i] = j; ok = 1;
}
}
int L, R,max,u,vr;
while (q){
fin >> L >> R;
max = -1;
for (u = L; u < R;++u)
{
vr = v[u];
if (max < vr - u && vr <=R)
max = vr-u;
}
fout << max << "\n";
q--;
}
return 0;
}