Cod sursa(job #2786258)
Utilizator | Data | 20 octombrie 2021 16:42:54 | |
---|---|---|---|
Problema | Secv | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("secv.in");
ofstream g("secv.out");
int n,v[6000],l,i,u[6000],k,j,r=1<<30;
set<int> s;
int main ()
{
for(f>>n,i=1;i<=n;++i)
f>>v[i],s.insert(v[i]);
for(;!s.empty();u[++k]=*(s.begin()),s.erase(s.begin()));
for(i=n;i;--i) {
for(l=1,j=i;j<=n&&l<=k;++j) {
if(v[j]==u[l])
++l;
}
if(l==k+1)
r=min(j-i,r);
}
g<<(r==1<<30?-1:r);
return 0;
}