题意
现在有一个矩阵,找出其中最大的子矩阵,保证子矩阵的元素和小于等于x。但是,这里的矩阵时通过两个行向量相乘给出,并不是直接给出的。输出一个整数,代表最大子矩阵的尺寸,也是就长乘宽。
(1<= n, m <= 2000)
思路
简单推算可知,一个子矩阵的元素和,就等于他的长和宽在两个行向量中对应的前缀和相乘。
也即sum = (a[i]+a[i+1]+...+a[j])*(b[ii]+b[ii+1]+...+b[jj])
然后n2枚举出在相同长度的边情况下,最小的前缀和。
最后分别枚举两组向量的长度,求出满足<= x的条件下,最大的子矩阵的面积。
#include<cstdio>
#include<queue>
#include<set>
#include<cstdlib>
#include<string.h>
#include<string>
#include<iostream>
#include<cmath>
#include<map>
#include<algorithm>
#define endl "\n"
#define IOS ios::sync_with_stdio(0), cin.tie(0),cout.tie(0)
#define ft first
#define sd second
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ll long long int
#define mt(a,b) memset(a, b, sizeof a)
//#define int long long
const double PI = acos(-1.0);
const int inf = 0x3f3f3f3f;
const int INF = 0x7fffffff;
using namespace std;
const int N = 2e5 + 7, M = 1e6 + 10;
int r[M], c[M];
int a[2004], b[2004];
int main()
{
IOS;
int n, m; cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> a[i], a[i] += a[i - 1];
for (int i = 1; i <= m; i++) cin >> b[i], b[i] += b[i - 1];
int x; cin >> x;
mt(r, 0x3f);
for (int i = 1; i <= n; i++)
for (int j = 0; j < i; j++)
r[i - j] = min(r[i - j], a[i] - a[j]);//贪心
mt(c, 0x3f);
for (int i = 1; i <= m; i++)
for (int j = 0; j < i; j++)
c[i - j] = min(c[i - j], b[i] - b[j]);
int maxn = 0;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
if ((ll)r[i] * c[j] <= x)
maxn = max(maxn, i * j);
cout << maxn << endl;
return 0;
}