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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
| #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;
vector<long long> ansvector(n);
for (int i = 0; i < n; i++)
{
ansvector[i] = v[i];
}
stack<int> s;
for (int i = 0; i < n; i++)
{
while (!s.empty())
{
if (v[s.top()] > v[i])
{
ansvector[s.top()] += (long long)v[s.top()] * (i - s.top() - 1);
s.pop();
}
else
{
break;
}
}
s.push(i);
}
while (!s.empty())
{
ansvector[s.top()] += (long long)v[s.top()] * (n - s.top() - 1);
s.pop();
}
for (int i = n -1; i >= 0; i--)
{
while (!s.empty())
{
if (v[s.top()] > v[i])
{
ansvector[s.top()] += (long long)v[s.top()] * (s.top() - i - 1);
s.pop();
}
else
{
break;
}
}
s.push(i);
}
while (!s.empty())
{
ansvector[s.top()] += (long long)v[s.top()] * (s.top());
s.pop();
}
for (int i = 0; i < n; i++)
{
ans = ans > ansvector[i] ? ans : ansvector[i];
}
return ans;
}
int main()
{
int n;
while (cin >> n)
{
if (n == 0)
{
break;
}
vector<int> v(n);
for (int i = 0; i < n; i++)
{
cin >> v[i];
}
cout<<LargetRectangle(n,v)<<endl;
}
return 0;
}
|