石子合并（区间DP经典例题）

题目链接：https://www.luogu.org/problemnew/show/P1880

#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <cstdlib>
#include <sstream>
#include <iostream>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
using namespace std;
#define ll long long
#define re register
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define P pair<int,int>
const int N=1e6+;
const int mod=1e9+;
void read(int &a)
{
    a=;
    int d=;
    char ch;
    while(ch=getchar(),ch>''||ch<'')
        if(ch=='-')
            d=-;
    a=ch-'';
    while(ch=getchar(),ch>=''&&ch<='')
        a=a*+ch-'';
    a*=d;
}
void write(int x)
{
    if(x<)
        putchar(),x=-x;
    if(x>)
        write(x/);
    putchar(x%+'');
}
int f1[][],f2[][],s[];
int main()
{
    int n;
    read(n);
    for(re int i=;i<=n;i++)
    {
        read(s[i]);
        s[i+n]=s[i];
    }
    for(re int i=;i<=*n;i++)
        s[i]=s[i-]+s[i];
    int j;
    for(re int k=;k<n;k++)
    {
        for(re int i=,j=i+k;j<*n&&i<*n;i++,j++)
        {
            f2[i][j]=0x3fffffff;
            for(re int t=i;t<j;t++)
                f1[i][j]=max(f1[i][j],f1[i][t]+f1[t+][j]+s[j]-s[i-]),f2[i][j]=min(f2[i][j],f2[i][t]+f2[t+][j]+s[j]-s[i-]);
        }
    }
    int ans1=0x3fffffff,ans2=;
    for(re int i=;i<=n;i++)
        ans1=min(ans1,f2[i][i+n-]),ans2=max(ans2,f1[i][i+n-]);
    write(ans1);
    putchar('\n');
    write(ans2);
    putchar('\n');
    return ;
}