pku 1651 Multiplication Puzzle （区间dp）

Multiplication Puzzle

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 5136		Accepted: 3075

Description

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*1*50 + 50*20*5 + 10*50*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*50*20 + 1*20*5 + 10*1*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

Source

Northeastern Europe 2001, Far-Eastern Subregion

题意：给出n个数相乘，每次从中抽取一个数出来与相邻两个数相乘，直到抽到只剩两个数字，第一个数和最后一个数不能抽，使每次相乘的数加起来的和最少。

题解：这是一个区间dp，dp【i】【j】保持 i~j 相乘得出的和最少的值，然后对长度、起点和划分点枚举，逐渐将区间合并，最后dp【1】【n】就是结果了

#include<stdio.h>
#include<string.h>
int a[105],dp[105][105];
int MIN(int a,int b){ return a<b?a:b; }
int main()
{
    int n,i,j,k,l;

    scanf("%d",&n);
    for(i=1;i<=n;i++) scanf("%d",a+i);
    memset(dp,0,sizeof(dp));
    for(l=2;l<n;l++)
    {
        for(i=1;i<=n-l;i++)
        {
            j=i+l;
            for(k=i+1;k<j;k++)
            {
                if(dp[i][j])
                    dp[i][j]=MIN(dp[i][j],dp[i][k]+dp[k][j]+a[i]*a[k]*a[j]);
                else
                    dp[i][j]=dp[i][k]+dp[k][j]+a[i]*a[k]*a[j];
            }
        }
    }
    printf("%d\n",dp[1][n]);

    return 0;
}