树形DP???
简单的树形DP。
f[i][j]
表示从
i
到
因为节点个数足够小,我们可以三维枚举
[l,r]
及根节点。
转移方程:
for (int k=2;k<=n;k++)
for (int i=1;i<=n-k+1;i++){
int x=i+k-1;
for (int j=i;j<=x;j++)
if (f[i][x]<f[i][j-1]*f[j+1][x]+w[j]){//取最大值
rt[i][x]=j;
f[i][x]=f[i][j-1]*f[j+1][x]+w[j];
}
}
注意刚开始的值全给1,不然乘的时候就······
代码:
#include<cstdio>
#include<cstring>
#include<algorithm>
#define MAXN 30
using namespace std;
int n;
int f[MAXN+5][MAXN+5],rt[MAXN+5][MAXN+5],w[MAXN+5];
inline char readc(){
static char buf[100000],*l=buf,*r=buf;
if (l==r) r=(l=buf)+fread(buf,1,100000,stdin);
if (l==r) return EOF;
return *l++;
}
int _read(){//读优(虽然没什么用)
int num=0; char ch=readc();
while (ch<'0'||ch>'9') ch=readc();
while (ch>='0'&&ch<='9') { num=num*10+ch-48; ch=readc(); }
return num;
}
void dfs(int x,int y){//中序遍历
if (x<=y){
printf("%d ",rt[x][y]);
dfs(x,rt[x][y]-1);
dfs(rt[x][y]+1,y);
}
}
int main(){
n=_read();
for (int i=0;i<=n;i++)
for (int j=0;j<=n;j++)
f[i][j]=1;
for (int i=1;i<=n;i++){
w[i]=_read();
rt[i][i]=i;
f[i][i]=w[i];
}
for (int k=2;k<=n;k++)
for (int i=1;i<=n-k+1;i++){
int x=i+k-1;
for (int j=i;j<=x;j++)
if (f[i][x]<f[i][j-1]*f[j+1][x]+w[j]){
rt[i][x]=j;
f[i][x]=f[i][j-1]*f[j+1][x]+w[j];
}
}
printf("%d\n",f[1][n]);
dfs(1,n);
return 0;
}