View Code of Problem 182

#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include<cstring>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include<climits>
using namespace std;

int main(void)
{
    int n;
    cin >> n;
    int arr[n][n];
    int mmax = -9999;
    for (int i = 0; i < n;i++){
        for (int j = 0; j < n;j++){
            cin >> arr[i][j];
        }
    }
    for (int i = 0; i < n;i++){
        int result[101] = {0};
        for (int j = i; j < n;j++){
            int sum = 0;
            for (int k = 0; k < n; k++){
                result[k] += arr[j][k];
                sum += result[k];
                sum = max(sum, result[k]);
                mmax = max(sum, mmax);
            }
        }
    }
    cout << mmax << endl;
}