CUC-SUMMER-CONTEST-1-F

F - Unimodal Array

CodeForces - 831A

---

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

---

题意：如果一个序列，开始是递增然后不变然后递减，则输出yes，否则输出no

解法：用三个bool类型来表示现在是递增不变还是递减的状态。然后遍历序列，看每个数是否符合现在的状态。

代码：

#include
using namespace std;
int a[105];
int main()
{
    int n;
    while(cin>>n){
    for(int i=0;i>a[i];
    int incs=1,decs=0,eq=0,flag=1;
    for(int i=1;ia[i-1]){
            if(decs==1||eq==1){
                flag=0;
                break;
            }
        }
        if(a[i]==a[i-1]){
            if(decs==1){
                flag=0;
                break;
            }
            if(eq==0)
                eq=1;
        }
        if(a[i]