CCF 压缩编码

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1010;
int num[maxn];
int sum[maxn];
int dp[maxn][maxn];

int main()
{
    memset(num, 0, sizeof(num));
    memset(sum, 0, sizeof(sum));
    memset(dp, 0x3f, sizeof(dp));
    int n;
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> num[i];
        sum[i] = sum[i-1] + num[i];
        dp[i][i] = 0;
    }
    for(int l = 2; l <= n; l++){              //滑动窗口大小
        for(int i = 1; i <= n-l+1; i++){
            int j = i+l-1;
            int sumij = sum[j] - sum[i-1];
            for(int k = i; k < j ; k++){
                dp[i][j] = min(dp[i][j], dp[i][k]+dp[k+1][j]+sumij) ;
            }
        }
    }
    cout << dp[1][n] << endl;
    return 0;
}