Pagini recente » Cod sursa (job #2077734) | Cod sursa (job #1312679) | Cod sursa (job #2826215) | Cod sursa (job #677867) | Cod sursa (job #748965)
Cod sursa(job #748965)
#include<cstdio>
using namespace std;
int mini,i1,i,m,nr,p,u,n,maxi,l,a[100002],st[100002],poz[100002],b[100002],in[100002],p1[100002];
int main()
{
freopen("secv.in","r",stdin);
freopen("secv.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
l=0;
st[0]=-1;
for(i=1;i<=n;i++)
{
if(a[i]>st[l])
{
l++;
st[l]=a[i];
p1[l]=i;
poz[i]=l;
in[i]=p1[1];
}
else
{
p=1;
u=l;
while(p<=u)
{
m=(p+u)/2;
if(st[m]>a[i]) u=m-1;
else
if(st[m]<a[i]) p=m+1;
else break;
}
if(p<=u) poz[i]=m;
else
{
if(p<=l)
{
poz[i]=p;
in[i]=p1[1];
st[p]=a[i];
p1[p]=i;
}
}
}
}
mini=n+1;
for(i=1;i<=n;i++)
if(poz[i]>maxi) maxi=poz[i];
for(i=1;i<=n;i++)
if(poz[i]==maxi&&i-in[i]+1<mini) mini=i-in[i]+1;
printf("%d\n",mini);
return 0;
}