-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathMaximumRectangle.cpp
91 lines (70 loc) · 1.61 KB
/
MaximumRectangle.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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
// { Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
#define MAX 1000
// } Driver Code Ends
/*You are required to complete this method*/
class Solution{
public:
int getMaxArea(int heights[], int n)
{
// Your code here
stack<int> st;
int currArea = 0, maxArea = 0;
int i;
st.push(0);
for(i = 1; i < n; i++)
{
while(!st.empty() && heights[st.top()] >= heights[i])
{
int tp = st.top();
st.pop();
currArea =heights[tp]*(st.empty()?(i):(i - st.top() - 1));
maxArea = max(maxArea,currArea);
}
st.push(i);
}
while(st.empty()==false)
{
int tp = st.top();
st.pop();
currArea = heights[tp]*(st.empty()?(i):(i - st.top() - 1));
maxArea = max(maxArea,currArea);
}
return maxArea;
}
int maxArea(int arr[MAX][MAX], int n, int m) {
// Your code here
int area = getMaxArea(arr[0],m);
for(int i = 1; i < n; i++)
{
for(int j = 0; j < m; j++)
{
if(arr[i][j]!= 0)
{
arr[i][j] += arr[i-1][j];
}
}
area = max(area,getMaxArea(arr[i],m));
}
return area;
}
};
// { Driver Code Starts.
int main() {
int T;
cin >> T;
int M[MAX][MAX];
while (T--) {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> M[i][j];
}
}
Solution obj;
cout << obj.maxArea(M, n, m) << endl;
}
}
// } Driver Code Ends