Pagini recente » Cod sursa (job #1738957) | Cod sursa (job #2376546) | Cod sursa (job #738202) | Cod sursa (job #1882366) | Cod sursa (job #1630316)
#include <bits/stdc++.h>
using namespace std;
int N;
vector<int>a;
void Read()
{
freopen("secv.in", "r", stdin);
scanf("%d", &N); a = vector<int>(N);
for(int i = 0; i < N; ++i)
scanf("%d", &a[i]);
}
void Solve()
{
vector<int>b = a;
sort(b.begin(), b.end());
b.resize( unique(b.begin(), b.end()) - b.begin());
int res = 1e8;
for(int i = 0; i < N; ++i)
{
int poz = 0;
for(int j = i; j < N; ++j)
{
if(a[j] == b[poz]) poz += 1;
if(poz == b.size())
{
res = min(res , j - i + 1);
break;
}
}
}
freopen("secv.out", "w", stdout);
if(res == (int)1e8) res = -1;
printf("%d", res);
}
int main() {
Read();
Solve();
return 0;
}