洛谷 P1880 石子合并

#include <cstdio>
#include <cstring>
#define N 205

int dp1[N][N],dp2[N][N],n,c[N][N],a[N];
inline int min(int a,int b) {return a>b?b:a;}
inline int max(int a,int b) {return a>b?a:b;}
int Main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;++i) scanf("%d",&a[i]),a[i+n]=a[i];
    for(int i=1;i<=n*2;++i)
     for(int j=i;j<=n*2;++j)
      c[i][j]=c[i][j-1]+a[j];
    memset(dp1,0x3f,sizeof(dp1));
    for(int i=1;i<=n*2;++i)
    {
        dp1[i][i+1]=dp2[i][i+1]=c[i][i+1];
        dp1[i][i]=dp2[i][i]=0;
    }
    for(int i=n*2-1;i>=1;--i)
    {
        for(int j=i+1;j<=n*2;++j)
        {
            for(int k=i+1;k<=j;++k)
            {
                if(i+1==k&&k==j) continue;
                dp1[i][j]=min(dp1[i][j],dp1[i][k-1]+dp1[k][j]+c[i][j]);
                dp2[i][j]=max(dp2[i][j],dp2[i][k-1]+dp2[k][j]+c[i][j]);
            }
        }
    }
    int ans2=0,ans1=0x7fffffff;
    for(int i=1;i<=n;++i)
     ans1=min(ans1,dp1[i][i+n-1]),ans2=max(ans2,dp2[i][i+n-1]);
    printf("%d\n%d",ans1,ans2);
    return 0;
}
int sb=Main();
int main(int argc,char *argv[]){;}