[Codeforces/코드포스] Educational Codeforces Round 69 (Div. 2) B - Pillars

Problem - 1197B - Codeforces

---

하노이의 탑의 변형 문제임을 생각한다

번호가 N인 디스크를 기준으로 '오른쪽'은 '내림차순', '왼쪽'은 '오름차순' 형태를 띄어야 한다

---

---

• 제목

Pillars

---

• 조건

time limit per test : 1.5 seconds

memory limit per test : 256 megabytes

input : standard input

output : standard 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:

1. there is no other pillar between pillars i and j. Formally, it means that |i−j|=1;
2. pillar i contains exactly one disk;
3. 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?

---

• 입력

The first line contains one integer nn (3≤n≤2⋅10^5) — the number of pillars.

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

---

• 출력

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

---

예제 입력 1	4 1 3 4 2	예제 입력 2	3 3 1 2
예제 출력 1	YES	예제 출력 2	NO

---

• 힌트

In the first case it is possible to place all disks on pillar 3 using the following sequence of actions:

1. take the disk with radius 3 from pillar 2 and place it on top of pillar 3;
2. take the disk with radius 1 from pillar 1 and place it on top of pillar 2;
3. take the disk with radius 2 from pillar 4 and place it on top of pillar 3;
4. take the disk with radius 1 from pillar 2 and place it on top of pillar 3.

---

#include <iostream>
#include <algorithm>
using namespace std;
int main() {
	int size, max_index, max;
	cin >> size;
	int* arr = new int[size];
	for (int n = 0; n < size; n++)
		cin >> arr[n];
	max = *max_element(arr, arr + size);
	for (int n = 0; n < size; n++)
		if (max == arr[n]) {
			max_index = n;
			break;
		}
	for (int n = max_index + 1; n < size - 1; n++) {
		if (arr[n] < arr[n + 1]) {
			cout << "NO" << endl;
			return 0;
		}
	}
	for (int n = max_index - 1; n > 0; n--) {
		if (arr[n] < arr[n - 1]) {
			cout << "NO" << endl;
			return 0;
		}
	}
	cout << "YES" << endl;
	return 0;
}