C. Maximum Subrectangle

                                                C. Maximum Subrectangle

Problem - 1060C - Codeforces

 思路：因为题目中说明了ai*bj=cij，我们能够想到c中任意一个矩形都等于a中连续的一段跟b中连续一段的乘积，所以并且矩阵的行数为连续a的长度，列数为连续b的长度，所以我们可以考虑枚举矩阵的边长，这样我们只需要找到在a中长度是i的和最小的序列，跟在b中长度是j的和最小的序列，那么矩阵的和为这两个数的乘积，而且我们能够前缀和，以及预处理，处理出a与b中任意长度的连续的最小的和，然后再暴力枚举所有的边长即可，时间复杂度是O(n^2)

// Problem: C. Maximum Subrectangle
// Contest: Codeforces - Codeforces Round 513 by Barcelona Bootcamp (rated, Div. 1 + Div. 2)
// URL: https://codeforces.com/problemset/problem/1060/C
// Memory Limit: 512 MB
// Time Limit: 2000 ms

#include<iostream>
#include<cstring>
#include<string>
#include<sstream>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<map>
#include<stack>
#include<vector> 
#include<set>
#include<unordered_map>
#include<ctime>
#include<cstdlib>
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int,int> PII;
typedef pair<int,pair<int,int> > PIII;
const double eps=1e-7;
const int N=5e5+7 ,M=5e5+7, INF=0x3f3f3f3f,mod=1e9+7;
const long long int llINF=0x3f3f3f3f3f3f3f3f;
inline ll read() {ll x=0,f=1;char c=getchar();while(c<'0'||c>'9') {if(c=='-') f=-1;c=getchar();}
while(c>='0'&&c<='9') {x=(ll)x*10+c-'0';c=getchar();} return x*f;}
inline void write(ll x) {if(x < 0) {putchar('-'); x = -x;}if(x >= 10) write(x / 10);putchar(x % 10 + '0');}
inline void write(ll x,char ch) {write(x);putchar(ch);}
void stin() {freopen("in_put.txt","r",stdin);freopen("my_out_put.txt","w",stdout);}
bool cmp0(int a,int b) {return a>b;}
template<typename T> T gcd(T a,T b) {return b==0?a:gcd(b,a%b);}
template<typename T> T lcm(T a,T b) {return a*b/gcd(a,b);}
void hack() {printf("\n----------------------------------\n");}

int T,hackT;
int n,m,k;
int a[N],b[N];
int suma[N],sumb[N];
int ma_len[N],mb_len[N];

void solve() {
	n=read(),m=read();
	
	for(int i=1;i<=n;i++) a[i]=read();
	for(int i=1;i<=m;i++) b[i]=read();
	for(int i=1;i<=n;i++) suma[i]=suma[i-1]+a[i];
	for(int i=1;i<=m;i++) sumb[i]=sumb[i-1]+b[i];
	int x=read();
	
	memset(ma_len,0x3f,sizeof ma_len);
	memset(mb_len,0x3f,sizeof mb_len);
	for(int i=1;i<=n;i++) {
		for(int j=i;j<=n;j++) {
			ma_len[j-i+1]=min(ma_len[j-i+1],suma[j]-suma[i-1]);
		}
	}
	
	for(int i=1;i<=m;i++) {
		for(int j=i;j<=m;j++) {
			mb_len[j-i+1]=min(mb_len[j-i+1],sumb[j]-sumb[i-1]);	
		}
 	}
 	
 	int ans=0;
 	for(int i=1;i<=n;i++) {
 		for(int j=1;j<=m;j++) {
 			if((ll)ma_len[i]*mb_len[j]<=x) ans=max(ans,i*j);
 		}
 	}
 	
 	write(ans,'\n');
}   

int main() {
    // init();
    // stin();

    // scanf("%d",&T);
    T=1; 
    while(T--) hackT++,solve();
    
    return 0;       
}