201612-4 压缩编码 100分 0ms 32ms

点击前往试题目录：https://blog.csdn.net/best335/article/details/99550556

GarsiaWachs算法优化 0ms

#include<iostream>
#include<vector>
using namespace std;
int main(){
	int n,ans=0,k,nk,lk,rk,j;
	vector<int> A;
	cin>>n;
	for(int i=0,a;i<n;++i) cin>>a,A.emplace_back(a);
	while((n=A.size())>2){
		for(k=1,lk=0,rk=2;rk<n&&A[lk]>A[rk];++lk,++k,++rk);
		A[lk]+=A[k],A.erase(A.begin()+k),j=lk-1,ans+=A[lk];
		while(j>-1&&A[j]<=A[lk])--j;
		A.insert(A.begin()+j+1,A[lk]),A.erase(A.begin()+lk+1);
	}
	cout<<(A.size()==2?A[0]+A[1]:A[0])+ans<<endl;
	return 0;
}

平行四边形优化 32ms

#include<iostream>
using namespace std;
int n,dp[1001][1001],s[1001][1001],sum[1001],INF=0x7fffffff;
int main(){
	cin>>n,sum[0]=0;
	for(int i=1,m;i<=n;++i)cin>>m,sum[i]=sum[i-1]+m,dp[i][i]=0,s[i][i]=i;
	for(int r=1;r<n;++r){
		for(int i=1,j=i+r,k;j<=n;++i,++j){
			for(k=s[i][j-1],dp[i][j]=INF;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;
                }
            }
		}
	}
	cout<<dp[1][n]<<endl;
	return 0;
}