- #include "iostream"
- #include "stdio.h"
- using namespace std;
- int inc1[200],inc2[200],a[200];
- //inc1-->longest increase array from head to tail
- //inc2-->longest increase array from tail to head
- int main()
- {
- int n;
- while(scanf("%d",&n)!=EOF)
- {
- int ans=0,i,j;
- for(i=1;i<=n;i++)
- scanf("%d",&a[i]);
- inc1[1]=1;
- for(i=2;i<=n;i++)
- {
- inc1[i]=1;
- for(j=1;j<i;j++)
- if(a[i]>a[j]&&inc1[j]+1>inc1[i])
- inc1[i]=inc1[j]+1;
- }
- inc2[n]=1;
- for(i=n-1;i>=1;i--)
- {
- inc2[i]=1;
- for(j=n;j>i;j--)
- if(a[j]<a[i]&&inc2[j]+1>inc2[i])
- inc2[i]=inc2[j]+1;
- }
- for(i=1;i<=n;i++)
- if(inc1[i]+inc2[i]-1>ans)
- ans=inc1[i]+inc2[i]-1;
- printf("%d\n",n-ans);
- }
- return 0;
- }