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

DP介绍-最长递增子序列

最长递增子序列系列是DP动态规划中简单、经典的入门题目。类似最长非递减子序列、导弹拦截问题、最长公共子序列问题等等。这在我们逐渐了解、认知动态规划的过程中可以给我们提高很大的帮助。 设有由n...
  • peihaozhu
  • peihaozhu
  • 2016年04月23日 21:37
  • 614

动态规划求最长递增子序列

最长递增子序列问题是一个很基本、较常见的小问题,但这个问题的求解方法却并不那么显而易见,需要较深入的思考和较好的算法素养才能得出良好的算法。由于这个问题能运用学过的基本的算法分析和设计的方法与思想,能...
  • qq_21120027
  • qq_21120027
  • 2015年08月18日 18:37
  • 2066

nyist oj 17 单调递增最长子序列 (动态规划经典题)

单调递增最长子序列 时间限制:3000 ms  |  内存限制:65535 KB 难度:4 描述求一个字符串的最长递增子序列的长度 如:dabdbf最长递增子序列就是abd...
  • u014253173
  • u014253173
  • 2014年08月15日 11:37
  • 4317

NKOI 1941 最长递增子序列

【线性规划与网络流24题 6】最长递增子序列 Time Limit:10000MS  Memory Limit:65536K Total Submit:19 Accepted:2  Case T...
  • getsum
  • getsum
  • 2016年08月06日 20:56
  • 408

最长递增子序列

一、题目描述 描述: N位同学站成一排,音乐老师要请其中的(N-K)位同学出列,使得剩下的K位同学不交换位置就能排成合唱队形。  合唱队形是指这样的一种队形:设K位同学从左到右依次编号为1, 2,...
  • u013074465
  • u013074465
  • 2015年05月02日 20:40
  • 4037

最长递增子序列 LIS 时间复杂度O(nlogn)的Java实现

求最长递增(递减)子序列 LIS时间复杂度O(nlogn)的Java实现...
  • iNiegang
  • iNiegang
  • 2015年08月15日 13:20
  • 2197

华为OJ2288-合唱队(最长递增子序列)

一、题目描述描述:N位同学站成一排,音乐老师要请其中的(N-K)位同学出列,使得剩下的K位同学不交换位置就能排成合唱队形。 合唱队形是指这样的一种队形:设K位同学从左到右依次编号为1, 2, …, ...
  • lisong694767315
  • lisong694767315
  • 2015年04月24日 13:04
  • 3524

最长递增子序列(输出最长递增序列 及其长度)

最长递增子序列的解法有很多种,常用的有最长公共子序列法、动态规划、记录所有递增序列长度最大值的方法。   最长公共子序列法:如例子中的数组A{5,6, 7, 1, 2, 8},则我们排序该...
  • bigbigtree911
  • bigbigtree911
  • 2014年09月22日 10:38
  • 1840

动态规划求最长连续递增子串

最长递增子序列问题是一个很基本、较常见的小问题,但这个问题的求解方法却并不那么显而易见,需要较深入的思考和较好的算法素养才能得出良好的算法。由于这个问题能运用学过的基本的算法分析和设计的方法与思想,能...
  • guoxinian
  • guoxinian
  • 2016年10月20日 17:20
  • 2290

动态规划算法之最长递增子序列问题

一、问题描述 在数字序列A中,按下标递增的顺序选出一个子序列B,如果选出的子序列B是严格递增的,则该子序列B称为原数字序列A的递增子序列。最长递增子序列问题就是找到原数字序列A中最长的递增子序列。例如...
  • tterminator
  • tterminator
  • 2016年03月22日 19:18
  • 5930
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:POJ 1836 DP(最长递增子序列)
举报原因:
原因补充:

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