cf1197B B. Pillars

B. Pillars
time limit per test1.5 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
There are n pillars aligned in a row and numbered from 1 to n.

Initially each pillar contains exactly one disk. The i-th pillar contains a disk having radius ai.

You can move these disks from one pillar to another. You can take a disk from pillar i and place it on top of pillar j if all these conditions are met:

there is no other pillar between pillars i and j. Formally, it means that |i−j|=1;
pillar i contains exactly one disk;
either pillar j contains no disks, or the topmost disk on pillar j has radius strictly greater than the radius of the disk you move.
When you place a disk on a pillar that already has some disks on it, you put the new disk on top of previously placed disks, so the new disk will be used to check the third condition if you try to place another disk on the same pillar.

You may take any disk and place it on other pillar any number of times, provided that every time you do it, all three aforementioned conditions are met. Now you wonder, is it possible to place all n disks on the same pillar simultaneously?

Input
The first line contains one integer n (3≤n≤2⋅105) — the number of pillars.

The second line contains n integers a1, a2, …, ai (1≤ai≤n), where ai is the radius of the disk initially placed on the i-th pillar. All numbers ai are distinct.

Output
Print YES if it is possible to place all the disks on the same pillar simultaneously, and NO otherwise. You may print each letter in any case (YES, yes, Yes will all be recognized as positive answer, NO, no and nO will all be recognized as negative answer).

Examples
input
4
1 3 4 2
output
YES
input
3
3 1 2
output
NO
Note
In the first case it is possible to place all disks on pillar 3 using the following sequence of actions:

take the disk with radius 3 from pillar 2 and place it on top of pillar 3;
take the disk with radius 1 from pillar 1 and place it on top of pillar 2;
take the disk with radius 2 from pillar 4 and place it on top of pillar 3;
take the disk with radius 1 from pillar 2 and place it on top of pillar 3.
**题意：**给出n个柱子，每个柱子一个圆盘，其半径各不相同，每次只能将柱子上只有一个圆盘的移到相邻位置，问能否全部移到一个柱子上。
**思路：**分析可以，要想全部移到一根柱子上，这个序列必须为前半部分递增，后半部分递减，或全部递增或递减。

#include <iostream>
#include <algorithm>
using namespace std;
int main() {
	int n, a[200005], k;
	scanf("%d", &n);
	for (int i = 0; i <n; i++) {
		scanf("%d", &a[i]);
		if (a[i] == n) k = i; // 最大数位置 
	}
	int flag = 0;
	for (int i = 0; i < k; i++) { // 判断最大数前面的数据是否递增 
		if (a[i] > a[i+1]) flag = 1;
	}
	for (int i = k; i < n - 1; i++) { // 判断最大数后面的数据是否递减 
		if (a[i+1] > a[i]) flag = 1;
	}
	if (!flag) printf("YES\n");
	else printf("NO\n");
	return 0;
}