Codeforces Round #513 C. Maximum Subrectangle(思维)

#include <bits/stdc++.h>
#define ll long long
#define inf 0x3f3f3f3f
#define maxn 20005
using namespace std;
ll a[maxn],b[maxn],_a[maxn],_b[maxn];
int n,m,x;

int main()
{
	scanf("%d%d",&n,&m);
	a[0] = 0; b[0] = 0;
	for(int i=1;i<=n;i++)scanf("%lld",&a[i]),a[i] += a[i-1];
	for(int i=1;i<=m;i++)scanf("%lld",&b[i]),b[i] += b[i-1];
	scanf("%d",&x);
	for(int i=1;i<=n;i++){
		_a[i] = inf;
		for(int j=i;j<=n;j++){
			_a[i] = min(_a[i], a[j] - a[j - i]);
		}
	}
	for(int i=1;i<=m;i++){
		_b[i] = inf;
		for(int j=i;j<=m;j++){
			_b[i] = min(_b[i], b[j] - b[j - i]);
		}
	}
	int ans = 0;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(_a[i] * _b[j] <= x){
				ans = max(ans, i * j);
			}
		}
	}
	printf("%d\n",ans);
	return 0;
}