poj 1836(简单DP+两边lis)

Alignment

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 11750		Accepted: 3746

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

Source

Romania OI 2002

 

拿到这个题目后，用了5分钟想到，满足条件的解一定构成一个 三角形（即先增后减，不会有波谷）。

而且这个三角形只有顶点（ 最高值）可以是 两个相同的值，在上升期间或者下降期间都必须是 严格单调的。

因此明显是枚举最高点+双边lis。

可是贡献了三次wrong answer。第一次WA是因为没有考虑最高点其实是 可以有2个相同取值的，比如：

1 2 3 3 2 1 这就是一个满足要求的序列。因此在lis的时候，上界（程序中的bound）事实上是可以 取等号的。

第二次WA是因为没有判断最高点重复的个数，如果左面的lis和右面的lis的最大值与data[i]都相同，那中间峰值处就会 有3个一样的身高，这种情况需要 减1。因此在main程序中加入了left_high 和 right_high的判断。

第三次WA一直没有找到，最后才发现是cmp函数中， 类型是double而不是int！！！！

 

提交记录：

1、WA， 修改work1和work2中，使得bound可以取等号。

2、WA， 修改对left_high 和 right_high的判断，使得不会有3个峰值。

3、WA，修改比较函数的输入类型a 和 b的类型为double！！！

4、Accepted。

 

/*Source Code

Problem: 1836		User: 775700879
Memory: 740K		Time: 407MS
Language: G++		Result: Accepted
Source Code*/
#include 
    
    
     
     
#include 
     
     
      
      
#include 
      
      
       
       
#include 
       
       
        
        
#include 
        
        
          #define oo 0x3f3f3f3f using namespace std; double data[2000]; double arr[2000] = {0}; int n; bool cmp(double a, double b) { return a > b; } int work1(int left, int right, double bound) { if (left >= n) return 0; if (right < 0) return 0; int result = 0; int i, j; memset(arr, 0, sizeof(arr)); for (i = left; i <= right; i++) { if (data[i] <= bound) { double *tmp = lower_bound(arr, arr+result, data[i]);//stl遵循"前闭后开" *tmp = data[i]; if (tmp-arr == result) result++; } } return result; } int work2(int left, int right, double bound) { if (left >= n) return 0; if (right < 0) return 0; int result = 0; memset(arr, 0, sizeof(arr)); int i, j; for (i = left; i <= right; i++) { if (data[i] <= bound) { double *tmp = lower_bound(arr, arr+result, data[i], cmp);//stl遵循"前闭后开" *tmp = data[i]; if (tmp-arr == result) result++; } } return result; } int main() { while(cin >> n) { int i, j; for (i = 0; i < n; i++) { cin >> data[i]; } int imax = 1; for (i = 0; i < n; i++) { memset(arr, 0, sizeof(arr)); int left = work1(0, i-1, data[i]); double left_high = arr[left-1]; memset(arr, 0, sizeof(arr)); int right = work2(i+1, n-1, data[i]); double right_high = arr[0]; if (right_high == left_high && left_high == data[i]) left--; if (left + right + 1 > imax) imax = left+right+1; } cout << n - imax << endl; } }