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