1063能量项链

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<string>
#include<vector>
#include<string.h>
#include<map>
#include<cmath>
#include<set>
#define ll long long
#define maxn 1000001
#define ull unsigned long long
using namespace std;

int w[205],t[205],f[205][205];
int main()
{
    ios::sync_with_stdio(false);
	int n,i,q,l,mid,r,j,k,ans=0;
	cin>>n;
	for(i=1;i<=n;i++)
	{
		cin>>t[i];
		t[i+n]=t[i];
		w[i-1]=t[i];
        w[i-1+n]=t[i];
	}
	w[2*n]=t[1];
	for(q=1;q<=n;q++)
	{
		for(l=1;l+q<=2*n;l++)
		{
			r=l+q-1;
			for(mid=l;mid<r;mid++)
				f[l][r]=max(f[l][mid]+f[mid+1][r]+t[l]*t[mid+1]*w[r],f[l][r]);
		}
	}
	for(i=1;i<=n;i++) ans=max(ans,f[i][i+n-1]);
	cout<<ans<<endl;
	return 0;
}