Submission #894636

#	Time	Username	Problem	Language	Result	Execution time	Memory
894636		IWKR	Global Warming (NOI13_gw)	C++17	40 / 40	180 ms	21848 KiB

gw

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

#define DEMON_SLAYER ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

int main() {
	DEMON_SLAYER
	int n;
	cin >> n;
	int prev = -1;
	vector<pair<int, int>> v;
	int cur = 0;
	int arr[n];
	for (int i = 0; i < n; i++) {
		int a;
		cin >> a;
		if (prev == a) {
			continue;
		}
		v.push_back({a, cur});
		prev = a;
		arr[cur] = a;
		cur++;
	}
	sort(v.begin(), v.end(), greater<pair<int, int>>());
	if (v.size() == 1) {
		cout << 1;
		return 0;
	}
	int ans = 0;
	int actans = 0;
	for (int i = 0; i < cur; i++) {
		pair<int, int> c = v[i];
		if (c.second == cur - 1) {
			if (arr[c.second - 1] <= c.first) {
				ans++;
			}
		} else if (c.second == 0) {
			if(arr[c.second + 1] < c.first) {
				ans++;
			}
		} else {
			if (arr[c.second - 1] > c.first && arr[c.second + 1] > c.first) {
				ans--;
			} else if (arr[c.second - 1] < c.first && arr[c.second + 1] < c.first) {
				ans++;
			}
		}
		if (i == cur - 1 || v[i].first != v[i + 1].first) {
			actans = max(actans, ans);
		}
	}
	cout << actans;
}

• Subtask 1: 6 / 6
• Subtask 2: 6 / 6
• Subtask 3: 7 / 7
• Subtask 4: 10 / 10
• Subtask 5: 11 / 11