ccf 201612-4压缩编码

dp动态规划

#include<cstdio>#pragma warning(disable:4996);using namespace std;int dp[1005][1005];int s[1005];int main(){    int n;    int _min;    scanf("%d",&n);    for (int i = 1; i <= n; ++i) {        scanf("%d",&dp[i][i]);        s[i] = s[i - 1] + dp[i][i];    }    for (int j = 2; j <= n; ++j) {        for (int i = 0; j + i <= n; ++i) {//dp[i+1][i+j]            _min = 999999999;            for (int k = 1 + i; k<j + i; ++k) {                if (dp[1 + i][k] + dp[k + 1][i + j] + s[i + j] - s[i]<_min) _min = dp[1 + i][k] + dp[k + 1][i + j] + s[i + j] - s[i];            }            dp[1 + i][j + i] = _min;        }    }    printf("%d\n",dp[1][n] - s[n]);}