Pagini recente » Cod sursa (job #2175785) | Cod sursa (job #564716) | Cod sursa (job #2753004) | Cod sursa (job #2203062) | Cod sursa (job #93680)
Cod sursa(job #93680)
#include<fstream.h>
ifstream f("secv.in");
ofstream g("secv.out");
long n,l,i,j,a[5010],v[5010],min,ok,k,c,aux;
int main()
{
f>>n;
l=1;
for(i=1;i<=n;i++)
{
f>>v[i];
c=0;
for(j=1;j<=l;j++)
if(v[i]==a[j])
{
c=1;
break;
}
if(c==0)
{
a[l]=v[i];
l++;
}
}
min=2*n;
l--;
for(i=1;i<l;i++)
for(j=i+1;j<=l;j++)
if(a[i]>a[j])
{
aux=a[i];
a[i]=a[j];
a[j]=aux;
}
for(i=1;i<=n-l+1;i++)
{
if(v[i]==a[1])
{
ok=0;
k=2;
j=i+1;
while(ok<l-1 && j<=n)
{
if(v[j]==a[k])
{
ok++;
j++;
k++;
}
else
j++;
}
j--;
if(ok==l-1 && j-i<min)
min=j-i;
}
}
if(min==2*n)
g<<-1;
else
g<<min;
f.close();
g.close();
return 0;
}