【例题1】石子合并
区间 D P DP DP 模板题,设 f [ i ] [ j ] f[i][j] f[i][j] 表示将第 i i i 堆到第 j j j 堆石子合并的代价,我们枚举一个断点 k k k,那么 f [ i ] [ j ] = min ( f [ i ] [ j ] , f [ i ] [ k ] + f [ k + 1 ] [ j ] + s u m [ j ] − s u m [ i − 1 ] ) f[i][j] = \min(f[i][j],f[i][k]+f[k+1][j]+sum[j]-sum[i-1]) f[i][j]=min(f[i][j],f[i][k]+f[k+1][j]+sum[j]−sum[i−1]) 这样 D P DP DP 即可。
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#define re register
#define drep(a,b,c) for(re int a(b) ; a>=(c) ; --a)
#define rep(a,b,c) for(re int a(b) ; a<=(c) ; ++a)
using namespace std;
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch == '-') f=-1 ; ch=getchar();}
while(ch>='0'&&ch<='9'){
x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
return x*f;
}
const int M = 210;
int n;
int f[M][M],g[M][M],a[M],sum[M];
signed main(){
memset(g,0x3f,sizeof(g));
n = read();
rep(i,1,n) a[i] = read(),a[i+n] = a[i];
rep(i,1,2*n) f[i][i] = g[i][i] = 0;
rep(i,1,2*n) sum[i] = sum[i-1] + a[i];
for(re int len(2) ; len<=n ; ++len){
for(re int i(1) ; i+len-1<=2*n ; ++i){
int j = i+len-1;
for(re int k(i) ; k<j ; ++k){
f[i][j] = max(f[i][j],f[i][k]+f[k+1][j]+sum[j]-sum[i-1]);
g[i][j] = min(g[i][j],g[i][k]+g[k+1][j]+sum[j]-sum[i-1]);
}
}
}
int ans1 = 0,ans2 = 1e9;
rep(i,1,n) ans1 = max(ans1,f[i][i+n-1]),ans2 = min(ans2,g[i][i+n-1]);
printf("%d\n%d\n",ans2,ans1);
return 0;
}
【例题2】木板涂色
跟上一道题差不多,唯一的区别就是当 i i i 和 j j j 颜色相同时, f [ i ] [ j ] = min ( f [ i + 1 ] [ j ] , f [ i ] [ j − 1 ] ) f[i][j] = \min(f[i+1][j],f[i][j-1]) f[i][j]=min(f[i+1][j],f[i][j−1])。
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#define re register
#define drep(a,b,c) for(re int a(b) ; a>=(c) ; --a)
#define rep(a,b,c) for(re int a(b) ; a<=(c) ; ++a)
using namespace std;
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch == '-') f=-1 ; ch=getchar();}
while(ch>='0'&&ch<='9'){
x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
return x*f;
}
const int M = 210;
char s[M];
int f[M][M];
signed main(){
scanf("%s",s+1);
int n = strlen(s+1);
memset(f,0x3f,sizeof(f));
rep(i,1,n) f[i][i] = 1;
rep(len,2,n){
for(re int i(1) ; i+len-1<=n ; ++i){
int j = i+len-1;
if(s[i] == s[j]) f[i][j] = min(f[i+1][j],f[i][j-1]);
for(re int k(i) ; k<j ; ++k){
f[i][j] = min(f[i][j],f[i][k]+f[k+1][j]);
}
}
}
printf("%d\n",f[1][n]);
return 0;
}
【例题3】消除木块
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#define re register
#define drep(a,b,c) for(re int a(b) ; a>=(c) ; --a)
#define rep(a,b,c) for(re int a(b) ; a<=(c) ; ++a)
using namespace std;
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch == '-') f=-1 ; ch=getchar();}
while(ch>='0'&&ch<='9'){
x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
return x*f;
}
inline void print(int x){
if(x < 0) putchar('-'),x = -x;
if(x >= 10) print(x / 10);
putchar(x % 10 + '0');
}
const int M = 210;
int f[M][M][M],a[M],col[M],len[M];
int T,n,tot;
inline void init(){
memset(f,0,sizeof(f));
memset(col,0,sizeof(col));
memset(len,0,sizeof(len));
tot = 0;
}
inline int dfs(int l,int r,int k){
if(f[l][r][k]) return f[l][r][k];
if(l == r) return (len[r]+k)*(len[r]+k);
f[l][r][k] = max(f[l][r][k],dfs(l,r-1,0)+(len[r]+k)*(len[r]+k));
rep(i,l,r-1) if(col[i] == col[r]) f[l][r][k] = max(f[l][r][k],dfs(l,i,k+len[r])+dfs(i+1,r-1,0));
return f[l][r][k];
}
signed main(){
T = read();
rep(cnt,1,T){
init()