链接:poj1651
题解
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
using namespace std;
const int N=107;
const ll inf=0x3f3f3f3f3f3f3f;
ll dp[N][N],nm[N];
int n;
int main(){
scanf("%d",&n);
rep(i,1,n)scanf("%d",&nm[i]);
rep(l,2,n-1)rep(i,2,n-l+2){
int j=i+l-1;
dp[i][j]=inf;
rep(k,i,j-1)dp[i][j]=min(dp[i][j],dp[i][k]+dp[k+1][j]+nm[k]*nm[i-1]*nm[j]);
}
printf("%lld\n",dp[2][n]);
return 0;
}