Pagini recente » Cod sursa (job #1776530) | Cod sursa (job #1245200) | Cod sursa (job #168375) | Cod sursa (job #1637121) | Cod sursa (job #93763)
Cod sursa(job #93763)
using namespace std;
#include <cstdio>
#include <set>
int a[5001], n;
int x[5001], nx;
void read()
{
freopen("secv.in","r",stdin);
scanf("%d\n", &n);
for(int i=1;i<=n;++i) scanf("%d ", a+i);
set<int>Q;
for(int i=1;i<=n;++i) Q.insert(a[i]);
for(set<int>::iterator it=Q.begin();it!=Q.end();++it) x[++nx]=*it;
}
void solve()
{
int i, j, nmin=0x3f3f3f3f;
int p;
for(i=1;i<=n;++i)
if(a[i]==x[1])
{
p=2;
for(j=i+1;j<=n;++j)
if(a[j]==x[p])
{
++p;
if(p>nx) break;
}
if(nmin>j-i && p==nx+1){nmin=j-i;}
}
freopen("secv.out","w",stdout);
printf("%d\n", nmin+1);
}
int main()
{
read();
solve();
return 0;
}