SMMR-T052: Bitonic Sequence

#include <bits/stdc++.h>
using namespace std;

const int N = 1000;

int arr[N + 10];

int main(){

    int nNumber;
    scanf("%d", &nNumber);
    arr[0] = -1e9;

    bool isDes = false;
    for(int i = 1; i <= nNumber; ++i){
        scanf("%d", &arr[i]);
        if(!isDes){
            if(arr[i] == arr[i - 1]){
                cout << "No";
                return 0;
            } else if(arr[i] < arr[i - 1]){
                isDes = true;
            }
        } else if(arr[i] >= arr[i - 1]){
            cout << "No";
            return 0;
        }
    }
    cout << "Yes";

    return 0;
}