zoukankan      html  css  js  c++  java
  • E

    Array of integers is unimodal, if:

    • it is strictly increasing in the beginning;
    • after that it is constant;
    • after that it is strictly decreasing.

    The first block (increasing) and the last block (decreasing) may be absent. It is allowed that both of this blocks are absent.

    For example, the following three arrays are unimodal: [5, 7, 11, 11, 2, 1][4, 4, 2],[7], but the following three are not unimodal: [5, 5, 6, 6, 1][1, 2, 1, 2][4, 5, 5, 6].

    Write a program that checks if an array is unimodal.

    Input

    The first line contains integer n (1 ≤ n ≤ 100) — the number of elements in the array.

    The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 1 000) — the elements of the array.

    Output

    Print "YES" if the given array is unimodal. Otherwise, print "NO".

    You can output each letter in any case (upper or lower).

    Example
    Input
    6
    1 5 5 5 4 2
    
    Output
    YES
    
    Input
    5
    10 20 30 20 10
    
    Output
    YES
    
    Input
    4
    1 2 1 2
    
    Output
    NO
    
    Input
    7
    3 3 3 3 3 3 3
    
    Output
    YES
    
    Note

    In the first example the array is unimodal, because it is strictly increasing in the beginning (from position 1 to position 2, inclusively), that it is constant (from position 2 to position 4, inclusively) and then it is strictly decreasing (from position 4 to position 6, inclusively).




    题解:这是一道判断一组数是是不是单峰的问题,且满足左边严格增加,中间平,最后严格减。


    代码为:

    #include<iostream>
    #include<cstdio>
    using namespace std;
    #define MAXN 110


    int a[MAXN];


    int main()
    {
        int n;
        while(cin>>n)
        {
            for(int i=1;i<=n;i++)
                cin>>a[i];
           
            int p=2;
            while(a[p]>a[p-1]) p++;
            while(a[p]==a[p-1]) p++;
            while(a[p]<a[p-1]) p++;
            if(p<=n) 
    cout<<"NO"<<endl;
            else 
    cout<<"YES"<<endl;
        }
        return 0;
    }


  • 相关阅读:
    伪多项式时间 Pseudo-polynomial time
    Aho-Corasick算法
    写给十八岁以下的你
    网络流算法
    Java static关键字
    带有负权边的最短路径问题
    Miller_Rabin(米勒拉宾)素数测试
    关于同余与模运算的总结
    UVa1585
    UVa修改版02
  • 原文地址:https://www.cnblogs.com/csushl/p/9386639.html
Copyright © 2011-2022 走看看