洛谷 p1063 能量项链[ 区间DP ] 2020-03-08 题解 算法 阅读次数 https://www.luogu.com.cn/problem/P1063 枚举区间的时候,tail 数组也要枚举… 123456789101112131415161718192021222324const int MAX=100+10;int n,a[MAX*2],d[MAX*2][MAX*2];int main(){ freopen("in","r",stdin); sf(n); fi(i,0,n){ sf(a[i]); a[i+n]=a[i]; } a[n*2]=a[0]; fi(k,2,n+1) fi(i,0,n*2-k){ //!! int j=i+k-1; fi(h,i,j){ d[i][j]=max(d[i][j],d[i][h] + d[h+1][j] + a[i]*a[h+1]*a[j+1]); } } int _max=0; fi(i,0,n){ _max=max(_max,d[i][i+n-1]); } pf(_max); return 0;}