全wa```cpp
#include <bits/stdc++.h>
using namespace std;
int n;
int a[201],f[201][201];
int ans;
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
a[i+n]=a[i];
}
for(int L=2;L<=n*2;L++){
for(int i=1;L+i-1<=n;i++){
int j=i+L-1;
for(int k=i;k<j;k++){
f[i][j]=max(f[i][j],f[i][k]+f[k+1][j]+a[i]*a[k+i]*a[j+1]);
}
ans=max(ans,f[i][j]);
}
}
printf("%d",ans);
return 0;
}
