-
Notifications
You must be signed in to change notification settings - Fork 0
/
MaxSumofRectangle.cpp
45 lines (36 loc) · 1.09 KB
/
MaxSumofRectangle.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
// Max Sum of Rectangle No Larger Than K
// Given an m x n matrix matrix and an integer k, return the max sum of a rectangle in the matrix such
// that its sum is no larger than k.
// It is guaranteed that there will be a rectangle with a sum no larger than k.
class Solution {
public:
int find(vector <int> &arr,int &k){
int sum=0,ans=INT_MIN;
set <int> s;
for(auto i:arr){
sum+=i;
if(sum<=k){
ans=max(ans,sum);
}
auto it=s.lower_bound(sum-k);
if(it!=s.end()){
ans=max(ans,sum-*it);
}
s.insert(sum);
}
return ans;
}
int maxSumSubmatrix(vector<vector<int>>& v, int k) {
int ans=INT_MIN;
for(int i=0;i<v[0].size();i++){
vector <int> arr(v.size(),0);
for(int j=i;j<v[0].size();j++){
for(int k=0;k<v.size();k++){
arr[k]+=v[k][j];
}
ans=max(ans,find(arr,k));
}
}
return ans;
}
};