zoukankan      html  css  js  c++  java
  • POJ1651(KB-E)

    Multiplication Puzzle

    Time Limit: 1000MS Memory Limit: 65536K
     Total Submissions: 10034 Accepted: 6200

    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
     
     1 //2017-05-23
     2 #include <cstdio>
     3 #include <cstring>
     4 #include <iostream>
     5 #include <algorithm>
     6 
     7 using namespace std;
     8 
     9 const int inf = 0x3f3f3f3f;
    10 int arr[110], dp[110][110];//dp[i][j]表示区间i到j的最小价值
    11 
    12 int main()
    13 {
    14     int n;
    15     while(scanf("%d", &n)==1){
    16         for(int i = 0; i < n; i++)scanf("%d", &arr[i]);
    17         for(int i = 0; i+2 < n; i++)dp[i][i+2] = arr[i]*arr[i+1]*arr[i+2];
    18         for(int len = 3; len < n; len++){
    19             for(int i = 0; i+len < n; i++){
    20                 int j = i+len;
    21                 dp[i][j] = inf;
    22                 for(int k = i+1; k < j; k++){
    23                     dp[i][j] = min(dp[i][j], dp[i][k]+dp[k][j]+arr[i]*arr[j]*arr[k]);
    24                 }
    25             }
    26         }
    27         printf("%d
    ", dp[0][n-1]);
    28     }
    29 
    30     return 0;
    31 }
  • 相关阅读:
    online ddl与pt-osc详解
    几个重点问题回顾
    死锁及常见死锁模型
    InnoDB中锁的算法(3)
    一个幻读模型引出的记录可见性判断
    jupyter notebook的使用
    l线程池抓取lianjia
    lagou数据爬取
    爬虫代理的设置
    linux如何安装和启动mongdb
  • 原文地址:https://www.cnblogs.com/Penn000/p/6893971.html
Copyright © 2011-2022 走看看