Pagini recente » Cod sursa (job #1273962) | Cod sursa (job #2815610) | Cod sursa (job #1311496) | Cod sursa (job #1141998) | Cod sursa (job #3182530)
#include <fstream>
#include <map>
using namespace std;
ifstream cin("secv.in");
ofstream cout("secv.out");
map <int,int> m;
int n,i,x,v[5005],l,a[5005],b[5005],p,u,mij,mn=99999999,nr,z,poz,ok,j,ind,k;
int main()
{
cin>>n;
for(i=1;i<=n;i++)
{
cin>>v[i];
if(!m[v[i]])
{
m[v[i]]=1;
++k;
}
}
for(i=1;i<=n;i++)
{
x=v[i];
if(x>a[nr]) {a[++nr]=x;z=i;b[i]=nr;}
else
{
p=1;
u=nr;
while(p<=u)
{
mij=(p+u)/2;
if(a[mij]<x) p=mij+1;
else {poz=mij;u=mij-1;}
}
a[poz]=x;
b[i]=poz;
}
}
for(i=1;i<=n;i++)
{
if(b[i]==k)
{
z=k-1;
ind=0;
for(j=i;j>=1;j--)
{
if(b[j]==z) {z--;}
if(z==0) {ind=j;break;}
}
if(z==0) mn=min(mn,i-ind+1);
}
}
if(mn==99999999) cout<<-1;
else cout<<mn;
return 0;
}