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
68
| #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <ctime>
using namespace std;
long long LargetRectangle(int n, vector<int>& v)
{
long long ans=0;
stack<int> s;
int temp = 0;
int index = 0;
long long cnt;
for (int i = 0; i < n; i++)
{
while (!s.empty())
{
if (v[s.top()] > v[i])
{
index = s.top();
s.pop();
temp = s.empty() ? (i) : (i - s.top() - 1);
cnt = (long long)v[index] * temp;
ans = ans > cnt ? ans : cnt;
}
else
{
break;
}
}
s.push(i);
}
while (!s.empty())
{
index = s.top();
s.pop();
temp = s.empty() ? (n) : (n - s.top() - 1);
cnt = (long long)v[index] * temp;
ans = ans > cnt ? ans : cnt;
}
return ans;
}
int main()
{
int n;
while (scanf("%d", &n)!= EOF)
{
if (n == 0)
{
break;
}
vector<int> v(n);
for (int i = 0; i < n; i++)
{
scanf("%d", &v[i]);
}
printf("%lld\n", LargetRectangle(n, v));
}
return 0;
}
|