Pagini recente » Cod sursa (job #2302920) | Cod sursa (job #537870) | Cod sursa (job #918898) | Cod sursa (job #2523244) | Cod sursa (job #1709161)
#include <iostream>
#include <fstream>
using namespace std;
int a[10001],b[100001],c[100001],n,q,i,j,x,y,mx;
int main()
{
ifstream fin("pq.in");
ofstream fout("pq.out");
fin>>n>>q;
for(i=1;i<=n;i++)
{
fin>>a[i];
for(j=i-1;j>0;j--)
{
if(a[i]==a[j])
{
c[j]=i;
b[i]=b[j]+1;
break;
}
}
}
for(i=1;i<=q;i++)
{
fin>>x>>y;
mx=-1;
for(j=x;j<y;j++)
{
if((c[j]!=0)&&(c[j]<=y))mx=max(mx,c[j]-j);
if(mx!=-1)
if(j>y-mx)break;
}
fout<<mx<<'\n';
}
fin.close();
fout.close();
return 0;
}