zoukankan      html  css  js  c++  java
  • 状态定义为删除两处之间所有数的dp

    题目:

    G - Multiplication Puzzle
    Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u
    Submit Status

    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

    代码:
     1 #include <iostream>
     2 #include <string.h>
     3 #include <stdio.h>
     4 using namespace std;
     5 const int INF=0xffffff;
     6 
     7 const int maxn=105;
     8 int a[maxn];
     9 int dp[maxn][maxn];
    10 
    11 int ddp(int i,int j)
    12 {
    13     if(dp[i][j]!=-1)
    14     return dp[i][j];
    15     if(j-i<=1)
    16     return dp[i][j]=0;
    17     int ans=INF;
    18     for(int k=i+1;k<=j-1;k++)
    19     {
    20         int x=ddp(i,k)+ddp(k,j)+a[i]*a[k]*a[j];
    21         if(ans>x)
    22         ans=x;
    23     }
    24     return dp[i][j]=ans;
    25 }
    26 
    27 int main()
    28 {
    29     int n;
    30     //freopen("aa.txt","r",stdin);
    31     while(scanf("%d",&n)!=EOF)
    32     {
    33         memset(dp,-1,sizeof(dp));
    34         for(int i=0;i<n;i++)
    35         scanf("%d",&a[i]);
    36         printf("%d
    ",ddp(0,n-1));
    37     }
    38     return 0;
    39 }
    View Code
  • 相关阅读:
    NOIP 2012 文化之旅
    史上最全的各种C++ STL容器全解析
    详解C++ STL map 容器
    详解C++ STL priority_queue 容器
    浅谈C++ STL stack 容器
    浅谈C++ STL queue 容器
    浅谈C++ STL vector 容器
    CF1185F Two Pizzas
    浅谈C++ STL deque 容器
    详解C++ STL multiset 容器
  • 原文地址:https://www.cnblogs.com/zhanzhao/p/3625197.html
Copyright © 2011-2022 走看看