提出 #76914133

---

ソースコード 拡げる

#include <iostream>
#include <vector>
#include <climits>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, M;
    cin >> N >> M;

    vector<vector<long long>> A(N, vector<long long>(M));

    for (int i = 0; i < N; i++) {
        for (int j = 0; j < M; j++) {
            cin >> A[i][j];
        }
    }

    long long answer = LLONG_MIN;

    vector<long long> colSum(M);

    for (int top = 0; top < N; top++) {

        fill(colSum.begin(), colSum.end(), 0);

        for (int bottom = top; bottom < N; bottom++) {

            for (int col = 0; col < M; col++) {
                colSum[col] += A[bottom][col];
            }

            // Kadane's Algorithm
            long long current = colSum[0];
            long long best = colSum[0];

            for (int col = 1; col < M; col++) {
                current = max(colSum[col], current + colSum[col]);
                best = max(best, current);
            }

            answer = max(answer, best);
        }
    }

    cout << answer << '\n';

    return 0;
}

提出情報

ジャッジ結果