Submission #1604891

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

int main(void) {
  int n;
  cin >> n;

  int d[51][51];
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      cin >> d[i][j];
    }
  }

  int q;
  cin >> q;

  vector<int> p(q);
  for (int i = 0; i < q; i++) {
    cin >> p[i];
  }

  int c[51][51] = {};
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      c[i][j] = d[i - 1][j - 1] + c[i - 1][j] + c[i][j - 1] - c[i - 1][j - 1];
    }
  }

  for (int i = 0; i < q; i++) {
    int ans = 0;
    for (int j = 1; j <= min(n, p[i]); j++) {
      int h = j, w = min(n, p[i] / j);
      for (int k = 1; k + h - 1 <= n; k++) {
        for (int l = 1; l + w - 1 <= n; l++) {
          ans = max(ans, c[k + h - 1][l + w - 1] - c[k + h - 1][l - 1] - c[k - 1][l + w - 1] + c[k - 1][l - 1]);
        }
      }
    }
    cout << ans << endl;
  }

  return 0;
}

Submission Info

Judge Result