POJ - 1836 Alignment

In the army, a platoon is composed by n soldiers. During the morning inspection, the soldiers are aligned in a straight line in front of the captain. The captain is not satisfied with the way his soldiers are aligned; it is true that the soldiers are aligned in order by their code number: 1 , 2 , 3 , . . . , n , but they are not aligned by their height. The captain asks some soldiers to get out of the line, as the soldiers that remain in the line, without changing their places, but getting closer, to form a new line, where each soldier can see by looking lengthwise the line at least one of the line's extremity (left or right). A soldier see an extremity if there isn't any soldiers with a higher or equal height than his height between him and that extremity. 

Write a program that, knowing the height of each soldier, determines the minimum number of soldiers which have to get out of line. 

Input

On the first line of the input is written the number of the soldiers n. On the second line is written a series of n floating numbers with at most 5 digits precision and separated by a space character. The k-th number from this line represents the height of the soldier who has the code k (1 <= k <= n). 

There are some restrictions: 
• 2 <= n <= 1000 
• the height are floating numbers from the interval [0.5, 2.5] 

Output

The only line of output will contain the number of the soldiers who have to get out of the line.

Sample Input

8
1.86 1.86 1.30621 2 1.4 1 1.97 2.2

Sample Output

4

题目大意：已知队伍里的每个人的身高，要求每个人至少可以看到这条队伍的最左边或者最右边，问最少需要踢出去几个人。

思路：有三种情况：从前向后一直递增，或者从后往前一直递增，或者峰值在中间，前一部分增后一部分减（注意一种情况：峰值可以是两个）。

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
double a[1010];
int dp1[1010],dp2[1010];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        memset(a,0,sizeof(a));
        for(int i=0;i<n;i++)
            scanf("%lf",&a[i]);
        for(int i=0;i<n;i++)
        {
            dp1[i]=1;
            for(int j=0;j<i;j++)
            {
                if(a[i]>a[j])
                dp1[i]=max(dp1[i],dp1[j]+1);
            }
        }//上升
        for(int i=n-1;i>=0;i--)
        {
            dp2[i]=1;
            for(int j=n-1;j>=i;j--)
            {
                if(a[i]>a[j])
                    dp2[i]=max(dp2[i],dp2[j]+1);
            }
        }//下降
        int ans=0;
        for(int i=0;i<n;i++)
            ans=max(ans,max(dp1[i],dp2[i]));//对每个点的上升长度和下降长度进行比较
        for(int i=0;i<n;i++)
            ans=max(ans,dp1[i]+dp2[i]-1);//对于每一个点前增后减
            for(int i=0;i<n;i++)
            {
                for(int j=i+1;j<n;j++)
                {
                    if(a[i]==a[j])
                        ans=max(ans,dp1[i]+dp2[j]);//峰值相同的情况
                }
            }
            printf("%d\n",n-ans);
    }
    return 0;
}