# POJ 1836 DP（最长递增子序列）

Alignment
Time Limit: 1000MS Memory Limit: 30000K
Total Submissions: 14860 Accepted: 4841

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

Alignment
Time Limit: 1000MS Memory Limit: 30000K
Total Submissions: 14860 Accepted: 4841

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 <algorithm>
#include <cstdio>
#include <cstring>
#define MAXSIZE 1000 + 10

using namespace std;

int dp1[MAXSIZE];
int dp2[MAXSIZE];
double a[MAXSIZE];
double aa[MAXSIZE];
double b[MAXSIZE];
int n;

void solve(int* dp,double* v){
dp[0] = 0;
dp[1] = 1;
int cnt = 1,i;
b[cnt] = v[1];
for(i = 2;i<=n;i++){
if(v[i]>b[cnt]){
b[++cnt] = v[i];
dp[i] = cnt;
}
else{
int k = lower_bound(b+1,b+cnt+1,v[i]) - b;
dp[i] = k;
b[k] = v[i];
}
}
}

int main()
{
//    freopen("data.in","r",stdin);
while(scanf("%d",&n)!=EOF){
int i,j;
for(i = 1;i<=n;i++){
scanf("%lf",&a[i]);
aa[n+1-i] = a[i];
}

solve(dp1,a);

solve(dp2,aa);

int Min = 0x3f3f3f3f;

for(i = 1;i<n;i++){
for(j = 1;j<=n-i;j++){
int tem = n - (dp1[i] + dp2[j]);
if(tem<Min)
Min = tem;
}
}

printf("%d\n",Min);

}
return 0;
}



• 本文已收录于以下专栏：

## poj 1631Bridging signals Dp（最长递增子序列）

Bridging signals Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 8689 ...

## POJ 2533 Longest Ordered Subsequence【最长递增子序列】【DP思想】

Longest Ordered Subsequence Time Limit : 4000/2000ms (Java/Other)   Memory Limit : 131072/65536K (J...

## poj 1836 Alignment -dp（合唱队形变式）-最长上升子序列+最长下降子序列

In the army, a platoon is composed by n soldiers. During the morning inspection, the soldiers are al...
• ly59782
• 2016年10月25日 23:38
• 142

## poj 1836 Alignment( 最长上升（下降）子序列 )

http://poj.org/problem?id=1836 题意：给n个士兵的身高，要求每个士兵向左或向右能看向无穷远处(新队列呈三角形分布)，最少要剔除几个士兵； 思路：对数列分别顺序，逆...

## [poj 1836] Alignment 最长上升子序列

Alignment Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 15300 Accepted: 4...
• ALPS233
• 2016年03月30日 10:32
• 321

## POJ 1836 Alignment LIS变形（最长上升子序列）

POJ 1836 Alignment    LIS变形（最长上升子序列） 题意：给 n 个数然后 让你求至少删除多少个数使剩下的数 可以满足在自己的位子上可以看到最左边或最右边的人 看到最边上人 ...

## 题目:[NOIP1999]拦截导弹(最长非递增子序列DP) O(n^2)和O(n*log(n))的两种做法

举报原因： 您举报文章：POJ 1836 DP（最长递增子序列） 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)