#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
const int N=1050;
int a[N*2];
int dp[2*N][2*N];
int s[2*N][2*N];
int sum[2*N];
int inf=9999999;
int main()
{
int n;
while(cin>>n)
{
for(int i=1;i<=n;i++){
cin>>a[i];
a[n+i]=a[i];
}
for(int i=1;i<=2*n;i++){
sum[i]=sum[i-1]+a[i];
}
memset(s,0,sizeof s);
memset(dp,inf,sizeof dp);
for(int i=1;i<=2*n;i++) dp[i][i]=0;//注意初始化
for(int i=2*n;i>=1;i--)
for(int j=i+1;j<=2*n;j++){
if(!s[i][j-1]) s[i][j-1]=i;
if(!s[i+1][j]) s[i+1][j]=j-1;
for(int k=s[i][j-1];k<=s[i+1][j];k++){//四边不等式优化
if(dp[i][j]>dp[i][k]+dp[k+1][j]+sum[j]-sum[i-1]){
dp[i][j]=dp[i][k]+dp[k+1][j]+sum[j]-sum[i-1];
s[i][j]=k;
}
}
}
int minn=999999999;
for(int i=1;i<=n;i++){
minn=min(minn,dp[i][i+n-1]);
}
cout<<minn<<endl;
}
return 0;
}
【hdu-3506四边不等式优化区间dp】Monkey Party
最新推荐文章于 2021-07-30 14:32:46 发布