http://www.51nod.com/Challenge/Problem.html#!#problemId=1022
环形石子归并;
总结:还是拉成连;要四边形优化成n^2;
四边形优化:
满足:a<b<=c<d且f[a][c]+f[b][d]<=f[a][d]+f[b][c]时可以用;
使用:s[i][j-1]<=s[i][j]<=s[i+1][j] ;要初始化;
#include<algorithm>
#include<set>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
const int maxn=1e6+9;
const int mod=1e9+7;
inline ll read()
{
ll f=1,x=0;
char ss=getchar();
while(ss<'0'||ss>'9')
{
if(ss=='-')f=-1;ss=getchar();
}
while(ss>='0'&&ss<='9')
{
x=x*10+ss-'0';ss=getchar();
} return f*x;
}
int dpmin[2009][2009];
int s[2009][2009];
int sum[2009];
int a[1009];
int main()
{
//FAST_IO;
//freopen("input.txt","r",stdin);
int n;
cin>>n;
mem(dpmin,INF);
mem(sum,0);
for(int i=1;i<=n;i++)
{
cin>>a[i];
sum[i]=sum[i-1]+a[i];
dpmin[i][i]=0;
s[i][i]=i;
}
for(int i=1;i<=n;i++)//拉成一条链
{
sum[i+n]=sum[i+n-1]+a[i];
dpmin[i+n][i+n]=0;
s[i+n][i+n]=i+n;
}
for(int len=2;len<=n;len++)//区间长度
{
for(int i=1;i+len<=2*n;i++)//区间起点
{
int j=i+len-1;//区间终点
/*for(int k=i;k<j;k++)//寻找区间中间的点来更新dp值
{
dpmin[i][j]=min(dpmin[i][j],dpmin[i][k]+dpmin[k+1][j]+sum[j]-sum[i-1]);
}*/
for(int k=s[i][j-1];k<=s[i+1][j];k++)
{
if(dpmin[i][j]>dpmin[i][k]+dpmin[k+1][j]+sum[j]-sum[i-1])
{
s[i][j]=k;
dpmin[i][j]=dpmin[i][k]+dpmin[k+1][j]+sum[j]-sum[i-1];
}
}
}
}
int ansmin=INF;
for(int i=1;i<=n;i++)
{
ansmin=min(dpmin[i][i+n-1],ansmin);
}
cout<<ansmin<<endl;
return 0;
}