CodeForces-Solutions/rectangle sum.cpp at main · vishalk11019/CodeForces-Solutions · GitHub

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
//saurabh kumar
//https://github.com/saurabhkumar1432
//date-1 october 2022
//time - 00:26
class Solution {
public:
    int maxSumSubmatrix(vector<vector<int>>& matrix, int k) {
         int m=matrix.size(),n=matrix[0].size();
        vector<vector<int>>dp(m+1,vector<int>(n,0));
        for(int i=0;i<m;i++){
            for(int j=0;j<n;j++){
                dp[i+1][j]=dp[i][j]+matrix[i][j];
            }
        }
        int ans=INT_MIN;
        for(int i=0;i<m;i++){
            for(int l=i+1;l<=m;l++){
                for(int j=0;j<n;j++){
                    int val=0;
                    for(int k=j;k<n;k++){
                        val+=dp[l][k]-dp[i][k];

                        if(val<k){
                            ans=max(ans,val);
                        }
                        else if(val==k){
                            return k;
                        }
                    }
                }
            }
        }
        return ans;

    }
};
class Solution {
public:
    int maxSumSubmatrix(vector<vector<int>>& matrix, int k) {
         int m=matrix.size(),n=matrix[0].size();
        vector<vector<int>>dp(m+1,vector<int>(n,0));
        for(int i=0;i<m;i++){
            for(int j=0;j<n;j++){
                dp[i+1][j]=dp[i][j]+matrix[i][j];
            }
        }
        int ans=INT_MIN;
        for(int i=0;i<m;i++){
            for(int l=i+1;l<=m;l++){
                for(int j=0;j<n;j++){
                    int val=0;
                    for(int k=j;k<n;k++){
                        val+=dp[l][k]-dp[i][k];

                        if(val<k){
                            ans=max(ans,val);
                        }
                        else if(val==k){
                            return k;
                        }
                    }
                }
            }
        }
        return ans;

    }
};