Codeforces 1060C.Maximum Subrectangle(数学等式转换+前缀和+枚举长度)

等式转换：
代码：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <string>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define deg(x) cout<< #x"=" << (x) << endl;
#define degg(x,y) cout<< #x"="<< (x) <<","<< #y"="<< (y) <<endl;
#define deggg(x,y,z) cout<<#x"="<<(x)<<","<<#y"="<<(y)<<","<<#z"="<<(z)<<endl;
#define sca(x) scanf("%d",&x)
#define scaa(x,y) scanf("%d%d",&x,&y)
#define scaaa(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define pch(x) putchar(x)
#define ptf(x) printf("%d\n",x)
#define ptff(x,y) printf("%d %d\n",x,y)
#define ptfff(x,y,z) printf("%d %d %d\n",x,y,z)
#define space(x) printf("%d ",x)
#define mes(a,x) memset(a,x,sizeof(a))
#define PI acos(-1)
#define lowbit(x) x&-x
#define ALL(X) (X).begin(), (X).end()
#define PB push_back
#define MP make_pair
#define ls rt<<1
#define rs rt<<1|1
#define X first
#define Y second
using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef priority_queue<int,vector<int>,greater<int> > xqueue;
typedef priority_queue<int> dqueue;

const ll mod=1e9+7;
const ll INF=9e18;
const int inf=2147483647;

const int N=2e3+5;
int a[N],b[N];
ll sum1[N],sum2[N];
ll f1[N],f2[N];

void work() {
    int n,m; scaa(n,m);
    for(int i=1;i<=n;i++) sca(a[i]);
    for(int i=1;i<=m;i++) sca(b[i]);
    int x; sca(x);
    for(int i=1;i<=n;i++) sum1[i]=sum1[i-1]+a[i],f1[i]=INF;
    for(int i=1;i<=m;i++) sum2[i]=sum2[i-1]+b[i],f2[i]=INF;
    for(int i=1;i<=n;i++) { //枚举长度为i
        for(int j=1;j+i-1<=n;j++)
            f1[i]=min(f1[i],sum1[j+i-1]-sum1[j-1]);
    }
    for(int i=1;i<=m;i++) {
        for(int j=1;j+i-1<=m;j++) {
            f2[i]=min(f2[i],sum2[j+i-1]-sum2[j-1]);
        }
    }
    int ans=0;
    for(int i=1;i<=n;i++) {
        for(int j=1;j<=m;j++) {
            if(f1[i]*f2[j]<=x) ans=max(i*j,ans);
        }
    }
    ptf(ans);
}

int main() {
#ifdef Local
    freopen("1.txt","r",stdin);
#endif // mm
    //IOS;
    work();
    return 0;
}