P1880 [NOI1995]石子合并

题源：https://www.luogu.org/problem/P1880

#include <bits/stdc++.h>

#define numm ch - 48
#define pd putchar(' ')
#define pn putchar('\n')
#define pb push_back
#define fi first
#define se second
#define fre1 freopen("1.txt", "r", stdin)
#define fre2 freopen("2.txt", "w", stdout)
typedef long long int ll;
typedef long long int LL;
using namespace std;

template<typename T>
void read(T &res) {
    bool flag = false;
    char ch;
    while (!isdigit(ch = getchar())) (ch == '-') && (flag = true);
    for (res = numm; isdigit(ch = getchar()); res = (res << 1) + (res << 3) + numm);
    flag && (res = -res);
}

template<typename T>
void write(T x) {
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        write(x / 10);
    putchar(x % 10 + '0');
}

//static auto _ = []() {
//    ios::sync_with_stdio(false);
//    cin.tie(0);
//    return 0;
//}();
//#pragma GCC optimize(3, "Ofast", "inline")
//

int n;
int s[205];
int t[205];

int mem[205][205], mem2[205][205];

int dfs(int l, int r) {
    if(~mem[l][r]) return mem[l][r];
    if (l == r) return 0;
    int ans = 0x3f3f3f3f;
    for (int i = l; i < r; i++) {
        ans = min(ans, t[r] - t[l - 1] + dfs(l, i) + dfs(i + 1, r));
    }
    return mem[l][r] = ans;
}

int dfs2(int l, int r) {
    if(~mem2[l][r]) return mem2[l][r];
    if (l == r) return 0;
    int ans = 0;
    for (int i = l; i < r; i++) {
        ans = max(ans, t[r] - t[l - 1] + dfs2(l, i) + dfs2(i + 1, r));
    }
    return mem2[l][r] = ans;
}

int main() {
    read(n);
    for (int i = 1; i <= n; i++) {
        read(s[i]);
        t[i] = s[i] + t[i - 1];
    }
    for (int i = 1; i <= n; i++) {
        t[n + i] = s[i] + t[n + i - 1];
    }
    int ans1 = 0x3f3f3f3f, ans2 = 0;
    memset(mem, -1, sizeof(mem));
    memset(mem2, -1, sizeof(mem2));
    for (int i = 0; i < n; i++) {
        ans1 = min(ans1, dfs(1 + i, n + i));
        ans2 = max(ans2, dfs2(1 + i, n + i));
    }
    write(ans1), pn;
    write(ans2);
    return 0;
}