CF831A-Unimodal Array
来源:互联网 发布:最牛不要钱淘宝刷粉丝 编辑:程序博客网 时间:2024/06/03 13:03
A. Unimodal Array
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard 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
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).
题目大意:有一个序列,如果满足左部严格上升(可以为空),中间恒定,右部严格下降(可以为空),那么就输出YES,否则输出NO。
解题思路:按照规则走一遍,如果没走完,那么就NO,否则YES。
#include<iostream>#include<cstdio>using namespace std;const int MAXN=105;const int INF=0x3f3f3f3f;int a[MAXN];int main(){ int n; while(cin>>n) { for(int i=1;i<=n;i++) cin>>a[i]; a[n+1]=INF; 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;}
- CF831A-Unimodal Array
- Codeforces831A Unimodal Array
- cf424div2 A. Unimodal Array
- A. Unimodal Array
- CodeForces 831A Unimodal Array
- cf round424 A.Unimodal Array
- Codeforces 831 A Unimodal Array
- CodeForces 831A-Unimodal Array
- codeforces 831A Unimodal Array
- A. Unimodal Array(段增减性
- CodeFroces 831A. Unimodal Array(构造题)
- Codeforces #831A: Unimodal Array 题解
- CodeForces 831A:Unimodal Array(模拟)
- Codeforces Round #424 (Div. 2) A. Unimodal Array(水题)
- Codeforces Round #424 (Div. 2) A. Unimodal Array
- Codeforces Round #424 (Div. 2) A. Unimodal Array
- Codeforces Round #424 (Div. 2) A. Unimodal Array
- Codeforces Round #424 (Div. 2) A. Unimodal Array
- ItemDecoration解析(三) 实现stickyHeader效果
- Mac中启动另一个程序并将窗口置于最前面
- 通过Arrary.prototype.slice.call浅谈类数组
- java 构造方法
- 驱动模块(driver) 和桩模块(stub)
- CF831A-Unimodal Array
- php上传图片
- DisallowMultipleComponent
- 如何在ViewPager中的各个Fragment间传递数据并刷新Fragment界面?
- 我们为什么要使用AOP?
- hiho-1014 Trie树 (Trie的建树与查询)
- 如何在CSDN上加上一个自己的小栏目
- PyQt5简易入门指南01,环境的配置与搭建
- NOIP 2015 Senior 4