UESTC 886 方老师金币堆

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#define Mod 1000000007
using namespace std;
#define N 207

int sum[N],a[N];
int dp[N][N],n;

int SUM(int i,int j)
{
    return sum[j]-sum[i-1];
}

int DP(int l,int r)
{
    if(dp[l][r] != -1)
        return dp[l][r];
    if(l == r)
        dp[l][r] = 0;
    else
        dp[l][r] = Mod;
    if(l<=n&&r<=n)
        return dp[l][r] = dp[l+n][r+n];
    for(int k=l;k<r;k++)
    {
        int cost = DP(l,k)+DP(k+1,r)+SUM(l,r);
        dp[l][r] = min(dp[l][r],cost);
    }
    return dp[l][r];
}

int main()
{
    int i,j;
    while(scanf("%d",&n)!=EOF)
    {
        sum[0] = 0;
        for(i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
            a[n+i] = a[i];
            sum[i] = sum[i-1]+a[i];
        }
        for(i=n+1;i<=2*n;i++)
            sum[i] = sum[i-1]+a[i];
        memset(dp,-1,sizeof(dp));
        for(i=2*n;i>=1;i--)
            for(j=i;j<=2*n;j++)
                DP(i,j);
        int res = Mod;
        for(i=1;i<=n;i++)
            res = min(res,DP(i,i+n-1));
        printf("%d\n",res);
    }
    return 0;
}