P1063 [NOIP2006 提高组] 能量项链

//#define local
#include<cstdio>
#include<iostream>
#define MAXN 105 
using namespace std;
typedef long long ll;
int max(const int &a,const int &b){
	return a>b?a:b;
}
int n,a[MAXN];
int maxe=0;
int dp[MAXN][MAXN]={0}; 
int main(){
#ifdef local
freopen("P1063_1.in","rb",stdin);//P1063_1.in
//freopen("data.out","wb",stdout);
#endif
scanf("%d",&n);
for(int i=0;i<n;++i){
	scanf("%d",&a[i]);
}
for(int start=0;start<n;++start){
	fill(dp[0],dp[0]+MAXN*MAXN,0);
	for(int len=2;len<=n;++len){//int len=2;len<=n;++len
		for(int i=start;i<=start+n-len;++i){
		    int j=i+len-1;
			for(int w=i;w<j;++w){
			dp[i%n][j%n]=max(dp[i%n][j%n],dp[i%n][w%n]+a[i%n]*a[(w+1)%n]*a[(j+1)%n]+dp[(w+1)%n][j%n]);
			}
		}
   }
	if(maxe<dp[start][(start+n-1)%n])
	maxe=dp[start][(start+n-1)%n];
}
printf("%d",maxe);
return 0;
}