POJ 1836 DP(最长递增子序列)

原创 2015年11月21日 15:38:37

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

题意:
有一队士兵,每个人有一个身高。从中踢走一些人,使得剩下的人都可以看到最左边或者最右边(也就是身高排列成一个梯形)。
解法:
将这个队列的最长递增子序列求出来,dp[i]表示到i位置时的最长递增子序列长度。然后我们可以把求dp[]的操作写到一个函数里,然后将原来的序列逆序一些,再调用那个函数,这样就得到了最长递减子序列长度。dp1[]是递增子序列长度,dp2[]是递减长度。那么接下来对每一个dp1[i],我们枚举dp2[]。即从递增里调一个,递减里挑一个组合起来,每一个这个操作得到的剔除的人数,记录剔除人数最少的那个数就可以了。

#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;
}

版权声明:博客迁移到 yaokun.wiki

相关文章推荐

poj 1631Bridging signals Dp(最长递增子序列)

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

poj 1631 Bridging signals (LIS 最长递增子序列 DP-二分)

题目:http://poj.org/problem?id=1631 思路:LIS 最长递增子序列,如果用一般的动态规划算法,复杂度是O(n^2),题目的数据规模下会超时,采用二分的思想:复杂度是O(...

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
  • 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
  • ALPS233
  • 2016年03月30日 10:32
  • 321

POJ 1836 Alignment 【最长上升(下降)子序列】

题目链接:http://poj.org/problem?id=1836 题目大意:对一排士兵重新排序,使新队列每个兵向左或向右都能看到左端或者右端,也就是使新队列的每个士兵的身高呈三角形分布即可。求出...

POJ 1836 Alignment LIS变形(最长上升子序列)

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

51Nod 1376 最长递增子序列的数量(dp+树状数组)

题目链接最长递增子序列的题做个不少,让求数量的第一次做,O(n^2)的代码很好写,但数据范围50000,故无情超时,想了很久,总算有所得。时间: O(nlog(n)) 空间: O(2*n)思路 ...

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

题目:[NOIP1999]拦截导弹 问题编号:217 题目描述 某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统。但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:POJ 1836 DP(最长递增子序列)
举报原因:
原因补充:

(最多只允许输入30个字)