Pagini recente » Cod sursa (job #2339302) | Cod sursa (job #1208054) | Cod sursa (job #878210) | Cod sursa (job #948835) | Cod sursa (job #19139)
Cod sursa(job #19139)
#include <cstdio>
#include <set>
#define maxn 5001
using namespace std;
int main()
{
int x[maxn],subsir[maxn],T=0, n, i,j;
freopen("secv.in", "r", stdin);
scanf("%d\n", &n);
for(i=1;i<=n;i++) scanf("%d ", &x[i]);
set<int> Q;
set<int>::iterator it;
for(i=1;i<=n;i++) Q.insert(x[i]);
for(it=Q.begin();it!=Q.end();++it) subsir[++T]=*it;
int nr=0, nrmin=0x3f3f3f3f;
for(i=1;i<=n-T+1;i++)
if(x[i]==subsir[1])
{
int t=2;
for(j=i+1;j<=n;j++)
{
if(x[j]==subsir[t]) t++;
if(t==T) { nr=j; break;}
}
if(nr<nrmin) nrmin=nr;
}
freopen("secv.out", "w", stdout);
printf("%d\n", nrmin);
return 0;
}