BANGSO C++

#include<bits/stdc++.h>
using namespace std;

int m;
int n;
int k;
int a[101][101];
int f[101][101] = {0};
int S_max = -99999999;
int S;
int i_min,i_max,j_min,j_max;

void input()
{
    cin >> m >> n;
    for(int i = 1; i <= m; i++)
    for(int j = 1; j <= n; j++)
    {
        cin >> a[i][j];
    }
}

void make_f()
{
    for(int i = 1; i <= m; i++)
    for(int j = 1; j <= n; j++)
    {
        f[i][j] = f[i-1][j] + f[i][j-1] - f[i-1][j-1] + a[i][j];
    }
}

int main()
{
    freopen("bangso.inp","r", stdin);
    freopen("bangso.out","w",stdout);
    input();
    make_f();
    for(int i = 1; i <= m; i++)
    for(int j = 1; j <= n; j++)
    {
        int u = i + 2;
        int v = j+2;
        if(u <= m && v <= n)
        {
            S = f[u][v] - f[i-1][v]-f[u][j-1]+f[i-1][j-1];
            if(S > S_max)
            {
                S_max = S;
                i_min = i;
                i_max = u;
                j_min = j;
                j_max = v;
            }
        }
    }
    cout << S_max << endl;
    cout << i_min <<" " << j_min;
    return 0;
}