题目大意:
有长度为 n n n的序列,将其分为 k k k部分 [ l i , r i ] [l_i,r_i] [li,ri],而每部分的代价为: s u m [ r i ] [ r i ] − s u m [ l i − 1 ] [ r i ] − s u m [ r i ] [ l i − 1 ] + s u m [ l i ] [ r i ] sum[r_i][r_i]-sum[l_i-1][r_i]-sum[r_i][l_i-1]+sum[l_i][r_i] sum[ri][ri]−sum[li−1][ri]−sum[ri][li−1]+sum[li][ri],而 s u m [ i ] [ j ] sum[i][j] sum[i][j]为二维矩阵前缀和,要求每部分之和最小
解题思路:
- 非常容易就可以得到 d p dp dp方程,设 d p [ i ] [ j ] dp[i][j] dp[i][j]前 i i i个分成 j j j组的最小代价: d p [ i ] [ j ] = m i n { d p [ k ] [ j − 1 ] + s u m [ i ] [ i ] − s u m [ j ] [ i ] − s u m [ i ] [ j ] + s u m [ j ] [ j ] } dp[i][j]=min\{dp[k][j-1]+sum[i][i]-sum[j][i]-sum[i][j]+sum[j][j]\} dp[i][j]=min{dp[k][j−1]+sum[i][i]−sum[j][i]−sum[i][j]+sum[j][j]}
- 解法一:可以用 d p dp dp的决策单调性进行分治求解
- 解法二:利用四边形不等式优化转移过程
- 像这种一部分单调递增,一部分单调递减,就很有可能跟决策优化有关
AC代码:
解法一:
#include <bits/stdc++.h>
#define ft first
#define sd second
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0) //不能跟puts混用
#define seteps(N) fixed << setprecision(N)
#define endl "\n"
const int maxn = 4e3 + 10;
using namespace std;
typedef double db;
typedef pair<int, int> pii;
const int mod = 1e9 + 7;
int n, m, w;
int sum[maxn][maxn];
int dp[810][maxn];
int opt[810][maxn];
int read(int res = 0) {char ch = getchar(); while (!isdigit(ch)) ch = getchar(); while (isdigit(ch)) res = res * 10 + (ch - '0'), ch = getchar(); return res;}
inline int cal(int i, int j) {return sum[i][i] - sum[i][j] - sum[j][i] + sum[j][j];}
void compute(int d, int L, int R, int optL, int optR) {
if (R < L) return;
int M = (L + R) >> 1;
int mmin = dp[d][M]; ;
for (int i = optL; i <= optR; i++) {
if (dp[d - 1][i] + cal(M, i) <= dp[d][M])
dp[d][M] = dp[d - 1][i] + cal(M, i), opt[d][M] = i;
}
compute(d, L, M - 1, optL, opt[d][M]);
compute(d, M + 1, R, opt[d][M], optR);
}
int main() {
// IOS;
memset(dp, 20, sizeof(dp));
// cin >> n >> m;
n = read(); m = read();
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
w = read();
sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + w;
}
dp[0][0] = 0;
for (int d = 1; d <= m; d++)
compute(d, 1, n, 0, n);
cout << dp[m][n] / 2 << endl;
return 0;
}
解法二:
#include <bits/stdc++.h>
#define ft first
#define sd second
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0) //不能跟puts混用
#define seteps(N) fixed << setprecision(N)
#define endl "\n"
const int maxn = 4e3 + 10;
using namespace std;
typedef double db;
typedef pair<int, int> pii;
const int mod = 1e9 + 7;
int n, m, w;
int read(int res = 0) {char ch = getchar(); while (!isdigit(ch)) ch = getchar(); while (isdigit(ch)) res = res * 10 + (ch - '0'), ch = getchar(); return res;}
int sum[maxn][maxn];
int dp[maxn][810];
int d[maxn][810];
int cal(int i, int j) {return sum[i][i] - sum[i][j] - sum[j][i] + sum[j][j];}
int main() {
// cin >> n >> m;
memset(dp, 20, sizeof(dp));
// scanf("%d%d", &n, &m);
n = read(), m = read();
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
w = read(), sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + w;
int inf = dp[0][0];
dp[0][0] = 0;
for (int j = 1; j <= m; j++) {
d[n + 1][j] = n;
for (int i = n; i >= 1; i--) {
int mmin = inf; int minid;
for (int k = d[i][j - 1]; k <= d[i + 1][j]; k++) {
if (dp[k][j - 1] + cal(i, k) <= mmin)
mmin = dp[k][j - 1] + cal(i, k), minid = k;
}
dp[i][j] = mmin;
d[i][j] = minid;
}
}
printf("%d\n", dp[n][m] / 2);
return 0;
}