main.cpp

站内文件视图直接读取仓库内容，Markdown 使用文档排版渲染，其余文本文件保持原始排版，方便校对训练证据链。

文件类型.cpp

10-cases/s2-jh-05-checkpoint-grid/02-solution/src/cpp/main.cpp

#include <iostream>
#include <string>
#include <vector>

using namespace std;

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

    int rows, cols, queries;
    if (!(cin >> rows >> cols >> queries)) {
        return 0;
    }
    vector<vector<long long>> prefix(rows + 1, vector<long long>(cols + 1, 0));
    for (int row = 1; row <= rows; ++row) {
        long long row_sum = 0;
        for (int col = 1; col <= cols; ++col) {
            long long value;
            cin >> value;
            row_sum += value;
            prefix[row][col] = prefix[row - 1][col] + row_sum;
        }
    }
    vector<long long> answers;
    int best_query = 1;
    long long best_sum = -1;
    for (int query_id = 1; query_id <= queries; ++query_id) {
        int r1, c1, r2, c2;
        cin >> r1 >> c1 >> r2 >> c2;
        long long total = prefix[r2][c2] - prefix[r1 - 1][c2] - prefix[r2][c1 - 1] + prefix[r1 - 1][c1 - 1];
        answers.push_back(total);
        if (total > best_sum) {
            best_sum = total;
            best_query = query_id;
        }
    }
    cout << "results=";
    for (size_t i = 0; i < answers.size(); ++i) {
        if (i) {
            cout << ' ';
        }
        cout << answers[i];
    }
    cout << "\n";
    cout << "best_query=" << best_query << ' ' << best_sum << "\n";
    return 0;
}