洛谷P1063 能量项链

经典区间DP

#include<iostream>
using namespace std;
#include<cmath>
#define INF 0x3f3f3f
int main()
{
	int n,i,j,k,len,maxn=0,a[205],f[205][205];
	cin>>n;
	for (i=1;i<=n;i++)
	{
		cin>>a[i];
		a[n+i]=a[i];
	}
	for (len=1;len<=n;len++)
	for(i=1,j=i+len;j<n+n;i++,j++)
    for(k=i;k<j;k++)
    {
	f[i][j]=max(f[i][j],f[i][k]+f[k+1][j]+a[i]*a[k+1]*a[j+1]);
	}
 	for (i=1;i<=n;i++) maxn=max(maxn,f[i][i+n-1]);
 	cout<<maxn;
 	return 0;
}