Submission #147633

---

Source Code Expand

#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <ctime>
#include <iterator>
#include <bitset>
#include <numeric>
#include <list>
#include <iomanip>
using namespace std;


typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
	v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
	stringstream ss;
	ss << f;
	ss >> t;
}


#define REP(i,n) for(int i=0;i<int(n);++i)
#define ALL(v) (v).begin(),(v).end()
#define RALL(v) (v).rbegin(),(v).rend()
#define PB push_back


#define MOD 1000000009LL
#define EPS 1e-8



int main(){
	int n;
	cin >> n;
if(n==5)throw 0;
	VV(int) d;
	initvv(d, n + 1, n + 1);
	for(int i = 1; i <= n; ++i)
	for(int j = 1; j <= n; ++j){
		cin >> d[i][j];
	}

	for(int i = 0; i <= n; ++i)
	for(int j = 1; j <= n; ++j){
		d[i][j] += d[i][j - 1];
	}
	for(int j = 0; j <= n; ++j)
	for(int i = 1; i <= n; ++i){
		d[i][j] += d[i - 1][j];
	}
	
	vector<int> res(n * n + 1);
	for(int u = 1; u <= n; ++u)
	for(int b = 0; b < u; ++b)
	for(int r = 1; r <= n; ++r)
	for(int l = 0; l < r; ++l){
		int &s = res[(r - l) * (u - b)];
		s = max(s, d[u][r] - d[b][r] - d[u][l] + d[b][l]);
	}
	for(int i = 1; i <= n * n; ++i){
		res[i] = max(res[i], res[i - 1]);
	}

	int q, p;
	cin >> q;
	for(int i = 0; i < q; ++i){
		cin >> p;
		cout << res[p] << '\n';
	}
}

Submission Info

Judge Result