@[congzihan414](/user/816840)
**参考一下：**
```cpp
#include <bits/stdc++.h>
const int N=500;
using namespace std;
struct node{
int x,y;
}a[N];
int n,dp[N][N];
int main(){
cin>>n;
int u;
cin>>u;
a[1].x=u;a[n].y=u;
for(int i=2;i<=n;i++){
cin>>u;
a[i-1].y=u; a[i].x=u;
a[n+i-1]=a[i-1];
}
a[2*n]=a[n];
for(int l=2;l<=n;l++){
for(int i=1;i<=2*n-l;i++){
int j=i+l-1;
if(j>2*n) continue;
for(int k=i;k<j;k++){
dp[i][j]=max(dp[i][j],dp[i][k]+dp[k+1][j]+a[i].x*a[k].y*a[j].y);
}
}
}
int ans=0;
for(int i=1;i<=n;i++){
ans=max(ans,dp[i][i+n-1]);
}
cout<<ans;
return 0;
}
```
>悬赏关注1个
by dingzj2022 @ 2023-08-03 20:33:01
@[dingzj2022](/user/945569) 已关
by c414 @ 2023-08-03 21:04:14
@[congzihan414](/user/816840) 收到
by dingzj2022 @ 2023-08-03 21:05:56