Submission #1593338

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <climits>
using namespace std;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, Q;
    cin >> N;
    vector<vector<int>> D(N+1, vector<int>(N+1, 0)), E(N+1, vector<int>(N+1, 0));
    for(int i=1; i<=N; i++)
        for(int j=1; j<=N; j++)
            cin >> D[i][j];
    for(int i=1; i<=N; i++)
        for(int j=1; j<=N; j++)
            E[i][j] = E[i][j-1] + D[i][j];
    for(int j=1; j<=N; j++)
        for(int i=1; i<=N; i++)
            E[i][j] += E[i-1][j];

    vector<int> v(N*N+1, 0);
    for(int i=0; i<=N; i++){
        for(int j=0; j<=N; j++){
            for(int k=i+1; k<=N; k++){
                for(int l=j+1; l<=N; l++){
                    int S = (k-i)*(l-j);
                    int T = E[k][l] - E[k][j] - E[i][l] + E[i][j];
                    v[S] = max(v[S], T);
                }
            }
        }
    }

    int a = 0;
    for(int i=1; i<=N*N; i++){
        a = max(a, v[i]);
        v[i] = a;
    }

    cin >> Q;
    for(int k=0; k<Q; k++){
        int P;
        cin >> P;
        cout << v[P] << endl;
    }

    return 0;
}

Submission Info

Judge Result