[动态规划]四边形不等式优化dp

http://www.51nod.com/Challenge/Problem.html#!#problemId=1022
用来优化形如 dp[i][j] = min{dp[i][k] + dp[k + 1][j] + cost[i][j]} 的dp，可以降低n倍复杂度。
是否能用四边形不等式优化需要证明：证明cost为凸、证明dp为凸、证明决策单调。但是有个更简单的方法判断是否能使用，那就是写出需要优化的暴力dp程序，输出s的表，看是否满足行列单调，满足就可以四边形不等式优化。

const int maxn = 1e3 + 5;
int a[2 * maxn], dp[2 * maxn][2 * maxn], s[2 * maxn][2 * maxn];

int main()
{
    int n;
    cin >> n;
    for (int i = 1; i <= n; ++i) cin >> a[i];
    for (int i = n + 1; i <= 2 * n; ++i) a[i] = a[i - n];
    for (int i = 1; i <= 2 * n; ++i) s[i][i] = i, a[i] += a[i - 1];

    for (int l = 1; l <= n; ++l){
        for (int i = 1; i + l <= 2 * n; ++i){
            int j = i + l;
            dp[i][j] = inf;
            for (int k = s[i][j - 1]; k <= s[i + 1][j]; ++k){
                if (dp[i][k] + dp[k + 1][j] < dp[i][j]){
                    s[i][j] = k;
                    dp[i][j] = dp[i][k] + dp[k + 1][j];
                }
            }
            dp[i][j] += a[j] - a[i - 1];
        }
    }

    int ans = inf;
    for (int i = 1; i <= n; ++i) ans = min(ans, dp[i][i + n - 1]);
    cout << ans << endl;

    for (int i = 1; i <= 2 * n; ++i){
        for (int j = 1; j <= 2 * n; ++j){
            cout << s[i][j] << ' ';
        }
        cout << endl;
    }
   
    return 0;
}