环形石子合并

对环形问题，不好划分，我们可以将环拉直并扩容一倍，之后正常进行普通的石子合并

拉直扩容代码

	for(int i = 1;i <= n;i ++) 
	{
		cin >> w[i];
		w[i + n] = w[i];
	}

#include <iostream>
#include <algorithm>

using namespace std;
using LL = long long;

const LL inf = 4e18;

const int N = 2e2 + 9;

int n;
LL w[N];
LL s[N];
LL f[N][N],g[N][N]; // f-最大代价 g-最小代价

void solve()
{
	cin >> n;
	for(int i = 1;i <= n;i ++) 
	{
		cin >> w[i];
		w[i + n] = w[i];
	}
	for (int i = 1;i <= 2 * n;i ++) s[i] = s[i - 1] + w[i];
	
	for (int len = 2;len <= n;len ++)
		for (int i = 1;i + len - 1 <= 2 * n;i ++)
		{
			int j = i + len - 1;
			f[i][j] = -inf,g[i][j] = inf;
			for (int k = i;k < j;k ++)
			{
				f[i][j] = max(f[i][j],f[i][k] + f[k + 1][j] + s[j] - s[i - 1]);
				g[i][j] = min(g[i][j],g[i][k] + g[k + 1][j] + s[j] - s[i - 1]);
			}
		}
	
	LL maxn = -inf,minn = inf;
	for (int i = 1;i <= n;i ++)
	{
		int j = i + n - 1;
		maxn = max(maxn,f[i][j]);
		minn = min(minn,g[i][j]);
	}
	
	cout << minn << endl << maxn << endl;
}