动态规划的经典题目,在遇到状态转移方程像min(w[i][k]+w[k+1][j]+m[i][j])的时候就可以使用考虑使用四边形优化。在i<=i'<=j<=j'的条件满足的情况下,有w[i'][j']+w[i][j] <= w[i'][j]+w[i][j'],那么就可以使用s[i][j] = {k|表示w[i][j]的最优决策},同时s[i][j]又有单调递增性(并没有仔细看论文。。。以后有时间一定补上)下面就上一下代码,如果没有优化,1000量级的算法运行会超过一秒,但是经过优化后就会在50ms左右。(也能通过这次CCF的第四题)
#include <iostream>
#include <cstring>
#include <cstdio>
#define min(a,b) (((a)<(b))?(a):(b))
using namespace std;
const int inf = 0x3f3f3f3f;
const int maxn = 1005;
int dp[maxn][maxn];
int sum[maxn];
int s[maxn][maxn];
int n;
void solve () {
memset(dp , inf , sizeof(dp));
for (int i = 1 ; i <= n ; i++) {
dp[i][i] = 0;
s[i][i] = i;
}
for (int l = 2 ; l <= n ; l++) {
for (int i = 1 ; i <= n-l+1 ; i++) {
int j = i+l-1;
for (int k = s[i][j-1] ; k <= s[i+1][j] ; k++) {
if(dp[i][j] > dp[i][k]+dp[k+1][j]+sum[j]-sum[i-1]) {
dp[i][j] = dp[i][k]+dp[k+1][j]+sum[j]-sum[i-1];
s[i][j] = k;
}
}
}
}
cout << dp[1][n] << endl;
}
int main () {
cin >> n;
for (int i = 1 ; i <= n ; i++) {
int a;
cin >> a;
sum[i] = sum[i-1]+a;
}
solve();
}