1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
#include <bits/stdc++.h>
using namespace std;

const int INPUT_SIZE = 1000010;

int pearls[INPUT_SIZE];

int sum_counting[INPUT_SIZE]; // If start is at least here, add value

stack<pair<int, int>> number_stack; // Keeps track of a decreasing list of previous numbers

int update_stack(int x, int pos) {
	while(!number_stack.empty() && x > number_stack.top().first) {
		number_stack.pop();
	}
	int result;
	if (number_stack.empty()) {
		result = -1;
	}
	else {
		result = number_stack.top().second;
	}
	// Maybe could remove some more elements, but that's unnecessary
	number_stack.push({x, pos});

	return result;
}

int main() {
	std::ios_base::sync_with_stdio(false);
	cin.tie(nullptr);

	int n;
	cin >> n;

	for (int i = 0; i < n; i++) {
		cin >> pearls[i];
		update_stack(pearls[i], i);
	}


	for (int i = 0; i < n; i++) {
		int prev_pos = update_stack(pearls[i], i);
		// Result cannot be -1 here because we will at least find ourselves

		if (prev_pos < i) {
			sum_counting[prev_pos + 1]++;
			sum_counting[i+1]--;
		}
		else {
			sum_counting[0]++;
			sum_counting[i+1]--;
			sum_counting[prev_pos+1]++;
		}
	}

	int sum_so_far = 0;
	int max_sum = 0;
	for (int i = 0; i < n; i++) {
		sum_so_far += sum_counting[i];
		if (sum_so_far > max_sum) {
			max_sum = sum_so_far;
		}
	}

	cout << max_sum << "\n";
}