poj解题报告——1836

#include<stdio.h>
#include<stdlib.h>
void main()
{
int n,i,j,result,m,up[1005],down[1005];
double a[1005];
while(scanf("%d",&n)!=EOF)
{
for(i=0;i<n;i++)
{
scanf("%lf",&a[i]);
}
m=0;
memset(up,0,sizeof(up));
memset(down,0,sizeof(down));
up[0]=1;
for(i=1;i<n;i++)
{
up[i]=1;
for(j=0;j<i;j++)
{
if(up[j]>=up[i]&&a[i]>a[j])
up[i]=up[j]+1;
}
}
down[n-1]=1;
for(i=n-2;i>=0;i--)
{
down[i]=1;
for(j=n-1;j>i;j--)
{
if(down[j]>=down[i]&&a[i]>a[j])
down[i]=down[j]+1;
}
}
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
if(up[i]+down[j]>m)
m=up[i]+down[j];
}
}
result=m;
printf("%d\n",n-result);
}
}