[DP] Codeforces 150D #107 (Div. 1) D. Mission Impassable

题目大意 删长度为$x$的回文串 会有得分$a_x$ 删完拼在一起 问最大得分
关键是设计状态 $f_{i,j,k}$ 表示把$[i,j]$这段 删除掉还剩长为$k$的回文串的最大代价
顺便$g_{i,j}$表示删完的代价
然后转移就不难看懂了

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
using namespace std;

inline char nc(){
  static char buf[100000],*p1=buf,*p2=buf;
  return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline void read(int &x){
  char c=nc(),b=1;
  for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
  for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}
inline int read(char *s){
  char c=nc(); int len=0;
  for (;!(c>='a' && c<='z');c=nc());
  for (;c>='a' && c<='z';s[++len]=c,c=nc()); s[++len]=0; return len-1;
}

const int N=155;

int n,a[N]; char s[N];
int f[N][N][N],g[N][N];
int ans[N];

int main(){
  freopen("t.in","r",stdin);
  freopen("t.out","w",stdout);
  read(n);
  for (int i=1;i<=n;i++) read(a[i]),a[i]=a[i]==-1?-1<<30:a[i]; read(s);
  memset(f,-0x3f,sizeof(f));
  memset(g,-0x3f,sizeof(g));
  for (int i=1;i<=n+1;i++) g[i][i-1]=0;
  for (int i=n;i;i--)
    for (int j=i;j<=n;j++)
      for (int k=1;k<=j-i+1;k++){
    if (s[i]==s[j]){
      if (k==1)
        f[i][j][k]=max(g[i][j-1],g[i+1][j]);
      else if (k==2)
        f[i][j][k]=max(f[i][j][k],g[i+1][j-1]);
      else
        f[i][j][k]=max(f[i][j][k],f[i+1][j-1][k-2]);
    }
    for (int x=i;x<j;x++){
      f[i][j][k]=max(f[i][j][k],f[i][x][k]+g[x+1][j]);
      f[i][j][k]=max(f[i][j][k],g[i][x]+f[x+1][j][k]);
    }
    g[i][j]=max(g[i][j],f[i][j][k]+a[k]);
      }
  for (int i=1;i<=n;i++){
    ans[i]=ans[i-1];
    for (int j=0;j<i;j++)
      ans[i]=max(ans[i],ans[j]+g[j+1][i]);
  }
  printf("%d\n",ans[n]);
  return 0;
}