题目链接:http://hihocoder.com/problemset/problem/1685
题解:先枚举上下界,压缩成一维,转化为求最长的子段和且长度小于K。先预处理前缀和t[],可转化为对于给定t[i],找到t[j]使得
t[j] - t[i-1] <= K, 但是这样仍是N^2, 整体是N^4,注意到对于给定i,我们枚举的时候,利用后缀samin[p]数组:表示从p位置往后最小的前缀和,这样一来,samin[]数组即为单调的,我们可以对于当前枚举的i,在samin[]数组里进行二分,找到满足
samin[p] - t[i-1] <= k 的最大的p,即为当前枚举最优,内层优化到了N * LOGN, 总体复杂度T(N) = O(N^3LogN);
#include <bits/stdc++.h>
using namespace std;
#define SZ(X) ((int)X.size())
#define ALL(V) begin(V),end(V)
#define mp make_pair
using ll = long long ;
using ld = long double ;
const int N = 307;
int a[N][N], pre[N][N];
int t[N], samin[N];
int main()
{
std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); cout << fixed;
int n, m, k;
cin >> n >> m >> k;
for(int i = 1;i <= n;i ++) for(int j = 1;j <= m;j ++) cin >> a[i][j];
for(int i = 1;i <= m;i ++) {
for(int j = 1;j <= n;j ++) {
pre[i][j] = pre[i][j-1] + a[j][i];
}
}
int res = -1;
for(int up = 1;up <= n;up ++) {
for(int limit = up;limit <= n;limit ++) {
int height = limit - up + 1;
for(int i = 1;i <= m;i ++) t[i] = pre[i][limit] - pre[i][up-1];
for(int i = 1;i <= m;i ++) t[i] += t[i-1];
samin[m] = t[m];
for(int i = m - 1;i >= 1;i --) samin[i] = min(samin[i+1], t[i]);
for(int i = 1;i <= m;i ++) {
int l = i, r = m;
while(l <= r) {
int mid = (l + r) >> 1;
if(samin[mid] - t[i-1] <= k) l = mid + 1;
else r = mid - 1;
}
if(r > i - 1) {
res = max(res, height * (r - i + 1) );
}
}
}
}
cout << res << endl;
return 0;
}