动态规划区间DP

类型

①环展开成链
②方案数
③区间DP+高精度
先把样例写对，然后将需要修改成高精度的地方再修改
④二维区间DP

两种实现方式
{
if 迭代式（一般一维好写，有固定的循环方式）
else 记忆化搜索式
}

acwing 1068

#include<algorithm>
#include<iostream>
#include<cstring>

using namespace std;

const int N = 410,INF = 0x3f3f3f3f;

int n;
int s[N],w[N];
int f[N][N],g[N][N];

int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>w[i];
		w[i+n] = w[i];
	}
	for(int i = 1;i<=n*2;i++) s[i] = s[i-1]+w[i];
	memset(f,0x3f,sizeof f);
	memset(g,-0x3f,sizeof f);
	for(int len = 1;len<=n;len++){
		for(int l = 1;l+len-1<=n*2;l++){
			int r = l+len-1;
			if(len==1)f[l][r] = g[l][r] = 0;
			else{
				for(int k=l;k<r;k++){
					f[l][r] = min(f[l][r],f[l][k]+f[k+1][r]+s[r]-s[l-1]);
					g[l][r] = max(g[l][r],g[l][k]+g[k+1][r]+s[r]-s[l-1]);
				}
			}
		}
	}
	int minv = INF,maxv = -INF;
	for(int i=1;i<=n;i++){
		minv = min(minv,f[i][i+n-1]);
		maxv = max(maxv,g[i][i+n-1]);
	}
	cout<<minv<<endl<<maxv<<endl;
	return 0;
}

acwing320

#include<iostream>
#include<algorithm>
#include<cstring>


using namespace std;

const int N  = 210;

int n,w[N],f[N][N];

int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>w[i];
		w[i+n] = w[i];
	}
	
	for(int len = 3;len<=n+1;len++){//长度为2是不能释放能量的 
		for(int l = 1;l+len-1<=n*2;l++){
			int r = l+len-1;
			for(int k=l+1;k<r;k++){
				f[l][r] = max(f[l][r],f[l][k]+f[k][r]+w[l]*w[r]*w[k]);
			}
		}
	}
	int res = 0;
	for(int i=1;i<=n;i++) res = max(res,f[i][i+n]);
	cout<<res<<endl;
	return 0;
} 

acwing 479

#include<iostream>
#include<cstring>
#include<algorithm>

using namespace std;

const int N = 30;

int n;
int w[N];
int f[N][N],g[N][N];

void dfs(int l,int r){
	if(l>r) return ;
	int root = g[l][r];
	cout<<root<<' ';
	dfs(l,root-1);
	dfs(root+1,r);
}

int main(){
	cin>>n;
	for(int i=1;i<=n;i++)cin>>w[i];
	
	for(int len = 1;len<=n;len++){
		for(int l = 1;l+len-1<=n;l++){
			int r = l+len-1;
			if(len==1){
				f[l][r] = w[l];
				g[l][r] = l;
			} 
			else{
				for(int k = l;k<=r;k++){
					int left = k==l?1:f[l][k-1];
					int right = k==r?1:f[k+1][r];
					int score = left *right +w[k];
					if(f[l][r]<score){
						f[l][r] = score;
						g[l][r] = k;
					}
				}
			}
		}
	}
	cout<<f[1][n]<<endl;
	dfs(1,n);
	return 0;
}

acwing1069

#include<iostream>
#include<algorithm>
#include<cstring>

using namespace std;
typedef long long ll;
const int N = 55,M = 35,INF = 1e9;
int n;
int w[N];
ll f[N][N][M];

void add(ll a[],ll b[]){
	static ll c[M];
	memset(c,0,sizeof c);
	for(int i=0,t=0;i<M;i++){
		t+=a[i]+b[i];
		c[i] = t%10;
		t/=10;
	}
	memcpy(a,c,sizeof c);
}

void mul(ll a[],ll b){
	static ll c[M];
	memset(c,0,sizeof c);
	ll t = 0;
	for(int i=0;i<M;i++){
		t+=a[i]*b;
		c[i] = t%10;
		t/=10;
	}
	memcpy(a,c,sizeof c);
}

int cmp(ll a[],ll b[]){
	for(int i=M-1;i>=0;i--){
		if(a[i]>b[i]) return 1;
		else if(a[i]<b[i]) return -1;
	}
	return 0;
}

void print(ll a[]){
	int k = M -1;
	while(k&&!a[k])k--;
	while(k>=0) cout<<a[k--];
	cout<<endl;
}

int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>w[i];//不需要求解两遍 
	}
	ll temp[M];
	for(int len = 3; len<=n;len++){
		for(int l = 1;l+len-1<=n;l++){
			int r = l+len-1;
			f[l][r][M-1] = 1;
			for(int k = l+1;k<r;k++){
				memset(temp,0,sizeof temp);
				temp[0] = w[l];
				mul(temp,w[k]);
				mul(temp,w[r]);
				add(temp,f[l][k]);
				add(temp,f[k][r]);
				if(cmp(f[l][r],temp)>0)
					memcpy(f[l][r],temp,sizeof temp);
			}
		}
	}
	print(f[1][n]);
	return 0;
} 

acwing 321