英语翻译DescriptionThe 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 ca

英语翻译DescriptionThe 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 ca
英语翻译
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

英语翻译DescriptionThe 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 ca
描述：
乘法游戏是用一排卡片玩的,每张卡片上有一个正整数.在游戏中玩家取出一张卡片记下得分,得分等于他取出的卡片及其左边、右边相邻卡片上的三个整数的乘积.第一张和最后一张卡片不允许取出.取出最后一张卡片后,原来的一排卡片就只剩下了两张.
游戏的目标就是获得的分数最少.
例如有一排卡片,分数分别是10 1 50 20 5,玩家可能先取1,然后是20,最后是50,得分就是：10*1*50 + 50*20*5 + 10*50*5 = 500+5000+2500 = 8000
如果他按相反的顺序来取,即50、20、1,得分就是：
1*50*20 + 1*20*5 + 10*1*5 = 1000+100+50 = 1150.
---------------------
输入
输入的第一行包括卡片的数目N(3 <= N <= 100).
第二行包括N个范围在1 到100的整数,用空格隔开.
输出
输出必须包含单个整数,即最小的得分
输入示例
6
10 1 50 50 20 5
输出示例
3650
＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝
好像是在说一个程序吧?

描述
多元化之谜是打每一排的卡片,每个晶片包含一个单独的正整数。在搬家期间的玩家需要一卡一排,得分点的数目等于该产品的数量及采取的卡片上的数字卡片在左边和右边的。它并不允许拿出第一个和最后一个卡在一排。决赛之后,只有两张移动被留在排。
目标是把卡在这种秩序最大限度地降低了总人数的得分点。
例如,如果牌:在排包含数量十1 50 20 5,球员可能会花1,然后用一张20至50岁...

全部展开

描述
多元化之谜是打每一排的卡片,每个晶片包含一个单独的正整数。在搬家期间的玩家需要一卡一排,得分点的数目等于该产品的数量及采取的卡片上的数字卡片在左边和右边的。它并不允许拿出第一个和最后一个卡在一排。决赛之后,只有两张移动被留在排。
目标是把卡在这种秩序最大限度地降低了总人数的得分点。
例如,如果牌:在排包含数量十1 50 20 5,球员可能会花1,然后用一张20至50岁的得分
10 * 1 * 50 + 50 * 20 * 5 + 10 * 50 * 5 = 500 + 5000 + 2500 = 8000
要是他再喝的卡片,特别是在相反顺序。50,那么20,然后1,比分是什么
1 * 50 * 20 + 1 * 20 * 5 + 10 * 1 * 5 = 1000 + 100 + 50 = 1150。
输入
输入的第一行包含一些卡N(3 < = N < = 100)。第二行含有N整数范围从1到100,用空格分开。
输出
输出必须包含一个单一的最小整数-得分。
样本输入
6
10 1 50 50 20 5
样本的输出
3650

收起