Skip to content

84.cpp #4

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Oct 5, 2020
Merged

84.cpp #4

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
124 changes: 124 additions & 0 deletions 84.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,124 @@
class Solution {
public:
int largestRectangleArea(vector<int>& A) {
int n=A.size();
stack<int>s;
vector<int>nsr;
for(int i=n-1;i>=0;i--)
{
if(s.empty())
{
nsr.push_back(n);
}
else if(A[s.top()]<A[i])
{
nsr.push_back(s.top());
}
else if(A[s.top()]>=A[i])
{
while(!s.empty()&&A[s.top()]>=A[i])
{
s.pop();
}
if(s.empty())
{
nsr.push_back(n);
}
else
nsr.push_back(s.top());
}
s.push(i);
}
reverse(nsr.begin(),nsr.end());
stack<int>ss;
vector<int>nsl;
for(int i=0;i<n;i++)
{
if(ss.empty())
{
nsl.push_back(-1);
}
else if(A[ss.top()]<A[i])
{
nsl.push_back(ss.top());
}
else if(A[ss.top()]>=A[i])
{
while(!ss.empty()&&A[ss.top()]>=A[i])
ss.pop();
if(ss.empty())
{
nsl.push_back(-1);
}
else
nsl.push_back(ss.top());
}
ss.push(i);
}
int ans=0;
for(int i=0;i<n;i++)
{
ans=max(ans,(nsr[i]-nsl[i]-1)*A[i]);
}
return ans; n=A.size();
stack<int>s;
vector<int>nsr;
for(int i=n-1;i>=0;i--)
{
if(s.empty())
{
nsr.push_back(n);
}
else if(A[s.top()]<A[i])
{
nsr.push_back(s.top());
}
else if(A[s.top()]>=A[i])
{
while(!s.empty()&&A[s.top()]>=A[i])
{
s.pop();
}
if(s.empty())
{
nsr.push_back(n);
}
else
nsr.push_back(s.top());
}
s.push(i);
}
reverse(nsr.begin(),nsr.end());
stack<int>ss;
vector<int>nsl;
for(int i=0;i<n;i++)
{
if(ss.empty())
{
nsl.push_back(-1);
}
else if(A[ss.top()]<A[i])
{
nsl.push_back(ss.top());
}
else if(A[ss.top()]>=A[i])
{
while(!ss.empty()&&A[ss.top()]>=A[i])
ss.pop();
if(ss.empty())
{
nsl.push_back(-1);
}
else
nsl.push_back(ss.top());
}
ss.push(i);
}
int ans=0;
for(int i=0;i<n;i++)
{
ans=max(ans,(nsr[i]-nsl[i]-1)*A[i]);
}
return ans;
}
};