Pagini recente » Cod sursa (job #1069153) | Cod sursa (job #1028977) | Cod sursa (job #157673) | Cod sursa (job #93839) | Cod sursa (job #1713663)
#include<cstdio>
#include<algorithm>
#define MAXN 5010
#define INF 2000000000
using namespace std;
int v[MAXN],v0[MAXN];
int main(){
freopen("secv.in","r",stdin);
freopen("secv.out","w",stdout);
int n,i,j=0,answer=INF,k,ok,nr;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&v[i]);
v0[i]=v[i];
}
sort(v0+1,v0+n+1);
v0[0]=INF;
for(i=1;i<=n;i++)
if(v0[i]!=v0[i-1]){
j++;
v0[j]=v0[i];
}
nr=j;
for(i=1;i<=n-nr+1;i++){
k=1;
for(j=i;j<=n&&k<=nr;j++)
if(v[j]==v0[k])
k++;
if(k>nr&&j-i<answer)
answer=j-i;
}
if(answer==INF)
printf("-1");
else
printf("%d",answer);
return 0;
}