Pagini recente » Cod sursa (job #3219887) | Cod sursa (job #2801269) | Cod sursa (job #1968797) | Cod sursa (job #859806) | Cod sursa (job #2771517)
#include <fstream>
#include <set>
using namespace std;
ifstream in("secv.in");
ofstream out("secv.out");
const int nmax=5e3;
int v[nmax+5],n;
set <int> s;
set <int> :: iterator it;
int verif(int k)
{
int i,l=1;
it=s.begin();
it++;
for(i=k+1; i<=n && it!=s.end(); i++)
{
if(v[i]==*it)
it++;
l++;
}
if(i==n+1 && it!=s.end())
return -1;
return l;
}
int main()
{
int i,lmin;
in>>n;
lmin=n+1;
for(i=1; i<=n; i++)
{
in>>v[i];
s.insert(v[i]);
}
it=s.begin();
for(i=1; i<=n; i++)
{
if(v[i]==*s.begin())
if(verif(i)!=-1)
lmin=min(verif(i),lmin);
}
if(lmin==n+1)
out<<-1;
else
out<<lmin;
return 0;
}