POJ 1651 Multiplication Puzzle（类似矩阵连乘区间dp）

传送门：http://poj.org/problem?id=1651

Multiplication Puzzle

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 13109		Accepted: 8034

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

Source

Northeastern Europe 2001, Far-Eastern Subregion

题目意思：

给你一串数字，头尾不能动，每次取出一个数字，这个数字贡献=该数字与左右相邻数字的乘积，求一个最小值。

分析：

是一个区间dp问题，类似矩阵连乘的做法，也是需要在一个区间中选择一个k值从而来达到你的某种要求，这里是要使得消去的值最小

概况一下题意就是：

初使ans=0,每次消去一个值,位置在pos（pos!=1 && pos !=n）
同时ans+=a[pos-1]*a[pos]*a[pos+1]，一直消元素直到最后剩余2个，求方案最小的ans是多少？

#include <iostream>
#include<algorithm>
#include <cstdio>
#include<cstring>
using namespace std;
#define max_v 105
#define INF 9999999
int a[max_v];
int dp[max_v][max_v];
int main()
{int n;while(~scanf("%d",&n)){for(int i=1;i<=n;i++){scanf("%d",&a[i]);}memset(dp,0,sizeof(dp));for(int r=2;r<n;r++){for(int i=2;i<=n-r+1;i++){int j=i+r-1;int t=INF;for(int k=i;k<=j-1;k++){t=min(t,dp[i][k]+dp[k+1][j]+a[i-1]*a[k]*a[j]);}dp[i][j]=t;}}printf("%d\n",dp[2][n]);}return 0;
}

转载于:https://www.cnblogs.com/yinbiao/p/9415933.html

POJ 1651 Multiplication Puzzle（类似矩阵连乘区间dp）相关推荐

POJ - 1651 Multiplication Puzzle (区间dp)
题目链接:Multiplication Puzzle 定义状态dp[i][j]表示将区间[i, j]全部取完所需要的最小代价,答案就是dp[1][n - 2]. 状态转移方程为:dp[i][j] = ...
poj - 1651 Multiplication Puzzle
简单DP,矩阵相乘,这次尝试自己写一个,居然过了,很好.本来今天还水了poj 1088 二维空间最长下降(上升)序列和 poj 3624 超水0,1背包,也想贴出来凑数的,可是zxpn同志说,这么水的 ...
POJ 1651 Multiplication Puzzle 区间dp（水
题目链接:点击打开链题意: 给定一个数组,每次能够选择内部的一个数 i 消除,获得的价值就是 a[i-1] * a[i] * a[i+1] 问最小价值思路: dp[l,r] = min( dp[l ...
【POJ - 1651】Multiplication Puzzle（区间dp）
题干: The multiplication puzzle is played with a row of cards, each containing a single positive integ ...
动态规划训练8 [E - Multiplication Puzzle POJ1651]
Multiplication Puzzle POJ - 1651 题意: 在一个序列中,拿走一个数字,那么得分就是这个数字以及它相邻的两个数字,这三个数字的乘积.求最小得分. 这道题乍一看感觉是区间D ...
【动态规划】区间DP - 最优矩阵链乘（另附POJ1651Multiplication Puzzle）
最优矩阵链乘(动态规划) 一个n∗mn*mn∗m的矩阵由 nnn 行 mmm 列共 n∗mn*mn∗m 排列而成.两个矩阵A和B可以相乘当且仅当A的列数等于B的行数.一个nm的矩阵乘mp的矩阵,运算量 ...
poj 1651区间dp
poj 1651 题意:给出一个序列,要求取走序列中出首尾之外的数字,问最小花费.取走第k个的花费a[k-1]*a[k]*a[k+1]. //#include<bits/stdc++.h> ...
【日常学习】【区间DP+高精】codevs1166 矩阵取数游戏题解
题目来自NOIP2007TG3 如果在考场上我现在已经歇菜了吧今天一整天的时间全部投在这道题上,收获不小. 先上题目题目描述 Description [问题描述] 帅帅经常跟同学玩一个矩阵取数游戏 ...

POJ 1651 Multiplication Puzzle（类似矩阵连乘区间dp）

POJ 1651 Multiplication Puzzle（类似矩阵连乘区间dp）相关推荐

最新文章

热门文章

POJ 1651 Multiplication Puzzle（类似矩阵连乘 区间dp）

POJ 1651 Multiplication Puzzle（类似矩阵连乘 区间dp）相关推荐

最新文章

热门文章

POJ 1651 Multiplication Puzzle（类似矩阵连乘区间dp）

POJ 1651 Multiplication Puzzle（类似矩阵连乘区间dp）相关推荐