-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
84.cpp
68 lines (63 loc) · 1.76 KB
/
84.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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
__________________________________________________________________________________________________
8ms
static const auto __ = []() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
return nullptr;
}();
class Solution {
public:
int largestRectangleArea(vector<int>& v)
{
int n=v.size();
vector<int> nsr(n),nsl(n);
stack<int> c1,c2;
for(int i=0;i<n;i++)
{
while(!c1.empty()&&v[c1.top()]>v[i])
{
c1.pop();
}
nsl[i]=c1.empty()?-1:c1.top();
c1.push(i);
}
for(int i=n-1;i>=0;i--)
{
while(!c2.empty()&&v[c2.top()]>=v[i])
{
c2.pop();
}
nsr[i]=c2.empty()?n:c2.top();
c2.push(i);
}
int ans=0;
for(int i=0;i<n;i++)
{
int h=v[i];
int w=nsr[i]-nsl[i]-1;
ans=max(ans,h*w);
}
return ans;
}
};
__________________________________________________________________________________________________
9576 kb
class Solution {
public:
int largestRectangleArea(vector<int>& heights) {
int res = 0;
for (int i = 0; i < heights.size(); i++) {
if (i+1 < heights.size() && heights[i] <= heights[i+1]) {
continue;
}
int minH = heights[i];
for (int j = i; j>=0; j--) {
minH = min(minH, heights[j]);
int area = minH * (i - j +1);
res = max(res, area);
}
}
return res;
}
};
__________________________________________________________________________________________________