Submission #8598018

---

Source Code Expand

#include<iostream>
#include<map>
#include<string.h>
#include<queue>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<cstdlib>
#include<math.h>
#include<set>
#include<array>
using namespace std;

template<class T>inline bool chmax(T&a, T b) { if (a < b) { a = b; return 1; }return 0; }
template<class T>inline bool chmin(T&a, T b) { if (a > b) { a = b; return 1; }return 0; }



#define rep(n) for(int i=0;i<(n);i++)
typedef pair<int, int> pii;

typedef long long ll;
typedef pair<ll, ll>pll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ll> vl;
typedef vector<vl> vll;
const int MOD = 1000000007;
const int INF = 1 << 29;
const long long LINF = 1LL << 60;


int main() {


	int h, w;
	ll p, v;
	cin >> h >> w>>p>>v;
	vll a(h, vl(w)), sum(h, vl(w+1, 0));
	rep(h) {
		for (int j = 0; j < w; j++) {
			cin >> a[i][j];
			sum[i][j + 1] = a[i][j] + sum[i][j];

		}
	}
		int ma = 0;
		rep(w) {
			for (int j = i + 1; j <= w; j++) {
				
				for (int k = 0; k < h; k++) {
                    
					for (int l = k; l < h; l++) {
						ll cnt = 0;
						for (int m = k; m <= l; m++) {
							cnt += sum[m][j] - sum[m][i];
						}
						if (cnt + p * (l - k + 1)*(j - i) <= v) {
							ma = max(ma, (l - k + 1)*(j - i ));
							//cout << i << j << k << l<<endl;
						}
						else break;
						
					}
				}

			}
		}
	
	cout << ma << endl;
	return 0;
}

Submission Info

Judge Result