题意:
题目链接:http://hihocoder.com/problemset/problem/1580?sid=1195305
给出一个矩阵,让你将其中一个数的值变成p(必须修改一个,且仅能修改一个),然后求最大子矩阵和。
思路:
2017北京网络赛C题,这题最后没A真是好气啊。
一开始被带偏榜,花了太多时间在D上,结果一直wa,后来C题过得多了再来看C题,秒出思路,然后一直WA到结束。
只不过是在最大子矩阵上加了一个修改,同样是枚举行x和行y作为子矩阵的上下边界,然后对这两行做差,得到一个序列,对这个序列一遍dp,求最大子段和即可。至于修改操作,当x和y确定了,肯定对于第j列在[x,y]之间找最小的数变成P(这样贡献最大),这点利用RMQ就行,然后设dp[i][0/1]分别表示到第i个数已经修改或者没修改的最大值,dp一下即可。
trick在于,修改的点不一定在子矩阵内的,当时懵逼只考虑了修改的点在子矩阵左边,其实也有可能在右边,甚至可能根本就不在枚举的x行到y行之间,需要分情况讨论,另外要注意常数,o(N^3),写挫就T了。
代码:
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <iostream>
using namespace std;
const int MAXN = 305;
const int INF = 0x3f3f3f3f;
int a[MAXN][MAXN], col[MAXN][MAXN], C[MAXN][MAXN][20];
void ST(int id, int n) {
for (int i = 1; i <= n; i++) C[id][i][0] = a[i][id];
for (int j = 1; (1 << j) <= n; j++) {
for (int i = 1; i + (1 << j) - 1 <= n; i++) {
int x = C[id][i][j - 1], y = C[id][i + (1 << (j - 1))][j - 1];
C[id][i][j] = min(x, y);
}
}
}
int RMQ(int id, int l, int r) {
int k = 0;
while ((1 << (k + 1)) <= r - l + 1) ++k;
int x = C[id][l][k], y = C[id][r - (1 << k) + 1][k];
return min(x, y);
}
int b[MAXN], dp[MAXN][2];
int main() {
//freopen("in.txt", "r", stdin);
int n, m, p;
while (scanf("%d%d%d", &n, &m, &p) == 3) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++)
scanf("%d", &a[i][j]);
}
for (int j = 1; j <= m; j++) {
col[0][j] = 0;
for (int i = 1; i <= n; i++)
col[i][j] = col[i - 1][j] + a[i][j];
ST(j, n);
}
int ans = -INF;
for (int x = 0; x < n; x++) {
for (int y = x + 1; y <= n; y++) {
for (int i = 1; i <= m; i++)
b[i] = col[y][i] - col[x][i];
dp[1][0] = b[1]; dp[1][1] = p - RMQ(1, x + 1, y) + b[1];
ans = max(ans, dp[1][1]);
if (!(x == 0 && y == n) || 1 < m) ans = max(ans, dp[1][0]);
for (int i = 2; i < m; i++) {
dp[i][0] = max(dp[i - 1][0] + b[i], b[i]);
//cout << RMQ(i, x + 1, y) << endl;
int t = p - RMQ(i, x + 1, y) + b[i];
// cout << i << " " << x + 1 << " " << y << " " << RMQ(i, x + 1, y) << endl;
dp[i][1] = max(dp[i - 1][0] + t, max(t, max(dp[i - 1][1] + b[i], b[i])));
ans = max(dp[i][1], max(dp[i][0], ans));
}
if (m > 1) {
int t = p - RMQ(m, x + 1, y) + b[m];
dp[m][0] = max(dp[m - 1][0] + b[m], b[m]);
dp[m][1] = max(dp[m - 1][0] + t, max(t, max(dp[m - 1][1] + b[m], b[m])));
ans = max(ans, dp[m][1]);
if (!(x == 0 && y == n)) ans = max(ans, dp[m][0]);
}
}
}
printf("%d\n", ans);
}
return 0;
}