zoukankan      html  css  js  c++  java
  • poj1836: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
    题解
    合唱队形的高精度版本。。。要注意中间两个人可以一样高。。mmp
     1 #include<cstdio>
     2 #include<algorithm>
     3 #include<cstring>
     4 #define maxn 1005
     5 int f[maxn],d[maxn];
     6 double a[maxn];
     7 int ans,n;
     8 using namespace std;
     9 int main()
    10 {
    11     scanf("%d",&n);
    12     for(int i = 1 ; i <= n ; ++i)
    13         scanf("%lf",&a[i]);
    14     for(int i = 1 ; i <= n ; ++i)
    15     {
    16         for(int j = i-1 ; j >= 1 ; --j)
    17             if(f[j]>f[i]&&a[i]>a[j])f[i]=f[j];
    18         f[i]++;
    19     }
    20     for(int i = n ; i >= 1 ; --i)
    21     {
    22         for(int j = i+1 ; j<=n ; ++j)
    23             if(d[j]>d[i]&&a[i]>a[j])d[i]=d[j];
    24         d[i]++;
    25     }
    26     for(int i = 1 ; i <= n ; ++i)
    27         for(int j=i+1 ; j<=n ; ++j)
    28             ans=max(ans,f[i]+d[j]);
    29     printf("%d",n-ans);
    30     return 0;
    31 }
    
    
    
    
    
  • 相关阅读:
    ubuntu服务器全部署
    果蝇优化算法(FOA)
    小波神经网络(WNN)
    R语言预测实战(第二章--预测方法论)
    ARIMA模型--粒子群优化算法(PSO)和遗传算法(GA)
    R语言预测实战(第一章)
    卷积神经网络(CNN)
    RSS(简易信息聚合)和jieba(第三方分词组件)
    第四章--基于概率论的分类方法:朴素贝叶斯--新闻分类(三)
    第四章--基于概率论的分类方法:朴素贝叶斯--过滤垃圾邮件(二)
  • 原文地址:https://www.cnblogs.com/fujudge/p/7523045.html
Copyright © 2011-2022 走看看