POJ:1836 Alignment

Alignment

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 16772		Accepted: 5484

Description

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<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<stdlib.h>
#include<stack>
#include<set>
#include<queue>
#define INF 0x3f3f3f3f
 
using namespace std;


int dp1[1003];  //正着
int dp2[1003];  //倒着 
float height[1003];
int main()
{
	int n;   //n is the number of soldiers
	while(~scanf("%d",&n))
	{
		for(int i = 0; i < n; i++)
		{
			scanf("%f",&height[i]);
		}
		for(int i = 0; i < n; i++)  //正着求 
		{	
			dp1[i] = 1;
			for(int j = 0; j < i; j++)
			{
				if(height[j]<height[i]&&dp1[j]+1>dp1[i])
					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(height[j]<height[i]&&dp2[j]+1>dp2[i])
					dp2[i] = dp2[j]+1;
			}
		}
		int max = -INF;
		for(int i = 0; i < n; i++)  //正着最长递增子序列与倒着最长递增子序列不能有交叉 
			for(int j = i+1; j < n; j++)
			{
				if(dp1[i]+dp2[j]>max)
					max = dp1[i]+dp2[j];
			} 
		printf("%d\n",n-max);
	}
	return 0;
}