CSU - 1592 石子归并 区间DP

思路：

dp[i][j] 表示选i - j 这个区间的最小价值

dp[0][0] = 0

用前缀和表示来求去这个区间得到的代价

dp[i][j] = min(dp[i][j],dp[i][k] + dp[k+1][j] + sum[j] - sum[i-1])  k 在 [i，j] 中

 

AC代码

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<queue>
#include<string>
#include<map>
#include<cmath>
#define INF 0x3f3f3f3f
#define rep(i,a,n) for(int i=a;i<n;i++)
#define per(i,a,n) for(int i=n-1;i>=a;i--)
#define fori(x) for(int i=0;i<x;i++)
#define forj(x) for(int j=0;j<x;j++)
#define memset(x,y) memset(x,y,sizeof(x))
#define memcpy(x,y) memcpy(x,y,sizeof(y))
#define sca(x) scanf("%d", &x)
#define scas(x) scanf("%s",x)
#define sca2(x,y) scanf("%d%d",&x,&y)
#define sca3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define scl(x) scanf("%lld",&x)
#define scl2(x,y) scanf("%lld%lld",&x,&y)
#define scl3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z)
#define pri(x) printf("%d\n",x)
#define pri2(x,y) printf("%d %d\n",x,y)
#define pris(x) printf("%s\n",x)
#define prl(x) printf("%lld\n",x)
//#include <bits/stdc++.h>

typedef long long ll;
const int maxn=1e6+7;
const int mod=1e9+7;
const double eps=1e-8;
// const double pi = acos(-1);

using namespace std;

int dp[200][200];
int a[40005];

int main()
{
  int t;
  sca(t);
  while(t--)
  {
    int n;
    sca(n);
    rep(i,1,n+1)
    {
      sca(a[i]);
      dp[i][i] = 0;
      a[i] += a[i-1];
    }
    rep(len,2,n+1)
    {
      rep(i,1,n+1)
      {
        int j = i + len - 1;
        dp[i][j] = INF;
        if(j > n)  break;
        dp[i][j] = INF;
        rep(k,i,j)
        {
          dp[i][j] = min(dp[i][j],dp[i][k] + dp[k+1][j]);
        }
        dp[i][j] += a[j] - a[i-1];
      }
    }
    pri(dp[1][n]);
  }

    return 0;
}