Pagini recente » Cod sursa (job #2254428) | Cod sursa (job #1716060) | Cod sursa (job #1782228) | Cod sursa (job #2097193) | Cod sursa (job #2777714)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("secv.in");
ofstream fout("secv.out");
int n;
int a[5005],b[5005],k;
int main()
{
fin>>n;
int i;
for(i=1; i<=n; i++)
fin>>a[i];
for(i=1; i<=n; i++)
b[i]=a[i];
sort(b+1,b+n+1);
k=1;
for(i=2; i<=n; i++)
if(b[i]>b[k])
b[++k]=b[i];
int ans=n+1;
for(i=1; i<=n; i++)
{
if(a[i]!=b[1])
continue;
int ind=2,j;
for(j=i+1; j<=n; j++)
{
if(a[j]==b[ind])
ind++;
if(ind==k+1)
break;
}
if(ind==k+1)
ans=min(ans,j-i+1);
}
fout<<ans<<"\n";
return 0;
}