-
Notifications
You must be signed in to change notification settings - Fork 0
/
main.cpp
49 lines (39 loc) · 935 Bytes
/
main.cpp
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
#include <cstdio>
#include <cstring>
#include <stack>
#include <algorithm>
using namespace std;
long long n, arr[100001];
long long histogram() {
stack<long long> st;
long long i, ret = 0;
st.push(-1);
for (i = 0; i < n; i++) {
while (!st.empty() && arr[i] < arr[st.top()]) {
int tmp = st.top();
st.pop();
if (!st.empty())
ret = max(ret, arr[tmp] * (i - st.top() - 1));
}
st.push(i);
}
while (!st.empty()) {
int tmp = st.top();
st.pop();
if (!st.empty())
ret = max(ret, arr[tmp] * (n - st.top()-1));
}
return ret;
}
int main() {
while (true) {
scanf("%lld", &n);
if (n == 0) {
break;
}
memset(arr, 0, sizeof(arr));
for (int i = 0; i < n; i++)
scanf("%lld", &arr[i]);
printf("%lld\n", histogram());
}
}