kuangbin 专题二十二 区间DP（POJ 1651）Multiplication Puzzle

Multiplication Puzzle

Time limit	1000 ms
Memory limit	65536 kB
OS	Linux

The multiplication puzzle is played with a row of cards, each containing a single positive integer. During the move player takes one card out of the row and scores the number of points equal to the product of the number on the card taken and the numbers on the cards on the left and on the right of it. It is not allowed to take out the first and the last card in the row. After the final move, only two cards are left in the row.

The goal is to take cards in such order as to minimize the total number of scored points.

For example, if cards in the row contain numbers 10 1 50 20 5, player might take a card with 1, then 20 and 50, scoring
$10\ast 1\ast 50+50\ast 20\ast 5+10\ast 50\ast 5=500+5000+2500=8000$

If he would take the cards in the opposite order, i.e. 50, then 20, then 1, the score would be
$1\ast 50\ast 20+1\ast 20\ast 5+10\ast 1\ast 5=1000+100+50=1150$.

• Input
  The first line of the input contains the number of cards N $(3<=N<=100)$. The second line contains N integers in the range from 1 to 100, separated by spaces.

• Output
  Output must contain a single integer - the minimal score.

• Sample Input
  6
  10 1 50 50 20 5

• Sample Output
  3650

一道区间DP的题
题意就是 N 张卡牌，每拿掉一张 score 就加上 $当前拿掉卡牌值\ast 左边未拿卡牌值\ast 右边未拿卡牌值$,第一张和最后一张卡牌不动，拿到只剩那两张牌为止，求 score 的最小值
好像也是板子emmm，就分割成分割点左右的牌都拿了的情况

Time	16ms
Memory	148kB
Length	798
Lang	C++

#include<cstdio>
#include<cstring>
#include <algorithm>

using namespace std;

int main() {
  int dp[105][105], a[105];
  int t, n;
  memset(dp, 0, sizeof(dp));
  memset(a, 0, sizeof(a));
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  for (int i = 0; i < n; i++) {
    for (int j = i+1; j < n; j++) {
       dp[i][j] = 0x3f3f3f3f;//迫使每个区间都要跑一遍找最优解
    }
  }
  for(int d = 1; d <= n; d++) {//枚举长度
    for(int j = 1;j < n-d; j++) {//枚举起点
      int end = j + d;
      for(int i = j; i <= end; i++) {//枚举分割点，更新小区间最优解
        dp[j][end] = min(dp[j][end], dp[j][i] + dp[i+1][end] + a[j-1]*a[i]*a[end]);
        //分割点左边即j~i的牌都拿光了，右边i~end的牌也拿光了的情况，加上a[j-1]*a[i]*a[end]
      }
    }
  }
  printf("%d\n", dp[1][n-1]);
  return 0;
}