zoukankan      html  css  js  c++  java
  • CodeForces

    A. Unimodal Array
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    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).

    Examples
    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

    直接按题意进行判断

    #include<stdio.h>
    bool flag;
    bool flag1;
    bool flag2;
    int main()
    {
    	int n;
    	int a[105];
    	while (~scanf("%d", &n))
    	{
    		flag = true;
    		flag1 = true;
    		flag2 = true;
    		for (int i = 0; i < n; i++)
    		{
    			scanf("%d", &a[i]);
    		}
    		if (n == 1)
    		{
    			printf("YES
    ");
    			continue;
    		}
    		for (int i = 1; i < n; i++)
    		{
    			if (a[i] == a[i - 1]&&flag1 )
    			{
    				flag = false;
    			}
    			else if (a[i]<a[i - 1])
    			{
    				flag = false;
    				flag1 = false;
    			}
    			else if (a[i] > a[i - 1] && (!flag||!flag1))
    			{
    				flag2 = false;
    				break;
    			}
    			else if (a[i] == a[i - 1] &&!flag1)
    			{
    				flag2 = false;
    			}
    		}
    		if (!flag2)
    		{
    			printf("NO
    ");
    		}
    		else
    		{
    			printf("YES
    ");
    		}
    	}
    	return 0;
    }


  • 相关阅读:
    网站初学笔记1
    如何在新项目中使用曾经创建的用户控件
    C#用户控件的一些尝试
    MVC的含义
    Chrome浏览器面板基础了解
    VScode快捷键
    Windows中的键盘快捷方式
    node.js状态码
    JavaScript小结
    Truncate a string
  • 原文地址:https://www.cnblogs.com/csu-lmw/p/9124478.html
Copyright © 2011-2022 走看看