zoukankan      html  css  js  c++  java
  • POJ 1836 Alignment (双向DP)

    Alignment
    Time Limit: 1000MS   Memory Limit: 30000K
    Total Submissions: 10804   Accepted: 3464

    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

    #include<iostream>
    #include<cstdio>
    #include<cstring>
    
    using namespace std;
    
    int n,dpl[1010],dpr[1010];
    double num[1010];
    
    int main(){
    
        //freopen("input.txt","r",stdin);
    
        while(~scanf("%d",&n)){
            for(int i=0;i<n;i++){
                scanf("%lf",&num[i]);
                dpl[i]=dpr[i]=1;
            }
    
            for(int i=0;i<n;i++)
                for(int j=0;j<i;j++)
                    if(num[i]>num[j] && dpl[i]<dpl[j]+1)
                        dpl[i]=dpl[j]+1;
            for(int i=n-1;i>=0;i--)
                for(int j=n-1;j>i;j--)
                    if(num[i]>num[j] && dpr[i]<dpr[j]+1)
                        dpr[i]=dpr[j]+1;
            int ans=0;
            for(int i=0;i<n;i++)
                if(ans<dpl[i]+dpr[i]-1)
                    ans=dpl[i]+dpr[i]-1;
            for(int i=0;i<n;i++)    //注意新队列中间的两个身高是否相同,相同则不需要减一
                for(int j=i+1;j<n;j++)
                    if(num[i]==num[j] && ans<dpl[i]+dpr[j])
                        ans=dpl[i]+dpr[j];
            printf("%d
    ",n-ans);
        }
        return 0;
    }
  • 相关阅读:
    笔记 : windows系统下 命令行 php --version 的版本与phpinfo()版本不一致问题
    笔记 : WampServe加装PHP版本(7.2.3)为例
    Browsersync结合gulp和nodemon实现express全栈自动刷新
    PHP与JSP简单比较
    BDD 与DSL 入门
    1.display:flex布局笔记
    Css预处理器---Less(三)
    python_30期_第2讲【字符串&运算符】
    python_30期_第5讲【while循环+for循环】
    class_05py作业
  • 原文地址:https://www.cnblogs.com/jackge/p/3160295.html
Copyright © 2011-2022 走看看