Submission #258921

---

Source Code Expand

#include <iostream>
using namespace std;

const int N_MAX = 100000;
const int H_MAX = 100000;

int main() {
	int N;
	cin >> N;

	int h[N_MAX] = {};
	int result1[N_MAX] = {};
	int result2[N_MAX] = {};
	for (int i = 0; i < N; i++) {
		cin >> h[i];
	}

	for (int i = 0; i < N; i++) {
		int count = 0;
		for (int j = i - 1; j >= 0; j--) {
			if (h[i] > h[j]) count++;
			else if (h[i] == h[j]) {
				count += result1[j] + 1;
				break;
			}
			else {
				break;
			}
		}
		result1[i] = count;
	}
	for (int i = N - 1; i >= 0; i--) {
		int count = 0;
		for (int j = i + 1; j < N; j++) {
			if (h[i] > h[j]) count++;
			else if (h[i] == h[j]) {
				count += result2[j] + 1;
				break;
			}
			else {
				break;
			}
		}
		result2[i] = count;
	}

	for (int i = 0; i < N; i++) {
		cout << result1[i] + result2[i] << endl;
	}

	return 0;
}

Submission Info

Judge Result