题意:给定n个数,求消除掉中间n-2个数最小代价,消除数a[i]的代价为a[l]*a[i]*a[r],a[l]和a[r]是它左右两边最近的剩下的数。
分析:设dp[i][j]表示消除i+1~j-1最小代价,那么合并就是dp[l][r]=min(dp[l][k]+dp[k][r]+a[l]*a[k]*a[r])。
代码:
#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<bitset>
#include<math.h>
#include<vector>
#include<string>
#include<sstream>
#include<stdio.h>
#include<cstring>
#include<iostream>
#include<algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int N=105;
const int MAX=1000000100;
const int mod=100000000;
const int MOD1=1000000007;
const int MOD2=1000000009;
const double EPS=0.00000001;
typedef long long ll;
const ll MOD=998244353;
const int INF=1000000010;
const double pi=acos(-1.0);
typedef double db;
typedef unsigned long long ull;
int a[N],dp[N][N];
int main()
{
int i,j,k,n;
while (scanf("%d", &n)!=EOF) {
for (i=1;i<=n;i++) scanf("%d", &a[i]);
for (i=1;i<n;i++) dp[i][i+1]=0;
for (i=3;i<=n;i++)
for (j=1;j<=n-i+1;j++) {
dp[j][j+i-1]=INF;
for (k=j+1;k<j+i-1;k++) dp[j][j+i-1]=min(dp[j][j+i-1],dp[j][k]+dp[k][j+i-1]+a[j]*a[k]*a[j+i-1]);
}
printf("%d\n", dp[1][n]);
}
return 0;
}