一堆石子合并(变环为线区间dp)

在一个圆形操场的四周摆放N堆石子,现要将石子有次序地合并成一堆.规定每次只能选相邻的2堆合并成新的一堆，并将新的一堆的石子数，记为该次合并的得分。

试设计出1个算法,计算出将N堆石子合并成1堆的最小得分和最大得分.

 

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string.h>
using namespace std;
const int maxn = 300;
int n;
int a[maxn], dp[maxn][maxn],ap[maxn][maxn], sum[maxn][maxn];
const int INF = 1000000000;
int main()
{
    cin >> n;
    memset(sum, 0, sizeof(sum));
    memset(a, 0, sizeof(a));
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        a[i + n] = a[i];//变环为线
    }
    for (int i = 1; i<=2 * n; i++) {
        for (int j = i; j<=2 * n; j++) {
            if (i == j) {
                dp[i][i] = 0; ap[i][i] = 0;//初始化	
            }
            else {
                ap[i][j] = 0; dp[i][j] = INF;//初始化dp和ap，分别储存最小和最大
            }
        }
    }
    for (int i = 1; i <= 2 * n; i++)
    {
        for (int j = i;j <= 2 * n; j++)
        {
            if (j == i)
                sum[i][j] = a[i];
            else {//处理前缀和问题；
                sum[i][j] = sum[i][j - 1] + a[j];
            }
        }
    }
    for (int len = 2; len <= n; len++)//枚举及区间长度;
    {
        for (int i = 1; i <= 2*n-len+1; i++)
        {
            int j = i + len - 1;
             
            for (int k = i; k < j; k++)
            {
                dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j] + sum[i][j]);
                ap[i][j] = max(ap[i][j], ap[i][k] + ap[k + 1][j] + sum[i][j]);
            }
        }
    }
    int maxu = -10000, minu = INF;
    for (int i = 1; i <=n; i++)
    {
        maxu = max(maxu, ap[i][n + i-1]);
        minu = min(minu, dp[i][n+ i-1]);
    }
    cout << minu << endl << maxu << endl;
    return 0;
}