zoukankan      html  css  js  c++  java
  • poj 1836 Alignment

    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 <cstdio>
    #include <cmath>
    using namespace std;
    
    int main()
    {
        int n;
        double s[1010];
        while(scanf("%d",&n)!=EOF)
        {
            int i,j,k,b[1010],c[1010];
            for(i=0; i<n; i++)
                scanf("%lf",&s[i]);
    
            for(i=0; i<n; i++)
            {
                b[i]=1;
                for(j=0; j<i; j++)
                    if(s[i]>s[j])
                        b[i]=max(b[i],b[j]+1);
            }
    
            for(i=n-1; i>=0; i--)
            {
                c[i]=1;
                for(j=n-1; j>i; j--)
                    if(s[i]>s[j])
                        c[i]=max(c[i],c[j]+1);
            }
    
            int p,q;
            int Max=0;
            for(i=0; i<n; i++)
            {
                p=i;
                q=i;
                for(j=i; j>=0; j--)
                    if(b[j]>=b[p]) p=j;
                for(k=i; k<n; k++)
                    if(c[k]>=c[q]) q=k;
                if(p==q)
                    Max=max(Max,b[p]+c[q]-1);
                else
                    Max=max(Max,b[p]+c[q]);
            }
    
            printf("%d
    ",n-Max);
        }
        return 0;
    }
    


  • 相关阅读:
    2014编程之美资格赛 第二题 大神和三个小伙伴
    操作系统PV操作——进程同步问题(C#实现)
    [转_管理]成功者必备的15种能力
    [技术相关]List、Dictionary转Dictionary的性能分析
    [项目管理]怎样评定软件开发成果的质量
    Visual Studio 2013 RTM 中文语言包官方下载地址发布
    IIS7报错:如果要使用托管的处理程序,请安装 ASP.NET
    HTTP请求方式中get和post的区别
    asp.net之动态页面和静态页面的区别
    HTML语言语法大全
  • 原文地址:https://www.cnblogs.com/keanuyaoo/p/3331338.html
Copyright © 2011-2022 走看看