zoukankan      html  css  js  c++  java
  • Cent Savings (DP)

    Cent Savings
    Time Limit: 5000ms, Special Time Limit:12500ms, Memory Limit:65536KB
    Total submit users: 59, Accepted users: 45
    Problem 13345 : No special judgement
    Problem description

    To host a regional contest like NWERC a lot of preparation is necessary: organizing rooms and computers, making a good problem set, inviting contestants, designing T-shirts, book- ing hotel rooms and so on. I am responsible for going shopping in the supermarket.

    When I get to the cash register, I put all my n items on the conveyor belt and wait until all the other customers in the queue in front of me are served. While waiting, I realize that this supermarket recently started to round the total price of a purchase to the nearest multiple of 10 cents (with 5 cents being rounded upwards). For example, 94 cents are rounded to 90 cents, while 95 are rounded to 100.

    It is possible to divide my purchase into groups and to pay for the parts separately. I managed to find d dividers to divide my purchase in up to d + 1 groups. I wonder where to place the dividers to minimize the total cost of my purchase. As I am running out of time, I do not want to rearrange items on the belt.

    Input

    The input consists of:

    • one line with two integers n (1 ≤ n ≤ 2000) and d (1 ≤ d ≤ 20), the number of items and the number of available dividers;

    • one line with n integers p1,…pn(1 ≤ pi≤ 10000 for 1 ≤ i ≤ n), the prices of the items in cents. The prices are given in the same order as the items appear on the belt.

    Output

    Output the minimum amount of money needed to buy all the items, using up to d dividers.

    Sample Input
    5 1
    13 21 55 60 42
    5 2
    1 1 1 1 1

    Sample Output
    190
    0

    Problem Source
    NWERC 2014
    n-1个空,然后插d块板
    dp[i][j]表示前n前物品被分成j-1堆的最少花费
    状态转移方程式:dp[i][j]=min(dp[i-1][j]+a[i],(dp[i-1][j-1]+5+a[i])/10*10);

    #include<stdio.h>
    #include<string.h>
    #include<iostream>
    #include<algorithm>
    #define maxn 2005 
    #define inf 0X3f3f3f3f
    using namespace std;
    long long dp[maxn][maxn];
    int a[maxn];
    long long lcl(long long x)
    {
        if(x%10>=5)
        x+=10;
        x-=x%10;
        return x;
    } 
    int main()
    {
        int n,d;
        while(scanf("%d %d",&n,&d)!=EOF) 
        {
            for(int i=1;i<=n;i++)
            scanf("%d",&a[i]);  
            memset(dp,0,sizeof(dp));
            for(int i=1;i<n;i++)
            {
                for(int j=0;j<=d;j++)
                {
                    if(j==0)
                    dp[i][j]+=dp[i-1][j]+a[i];
                    else
                    dp[i][j]=min(dp[i-1][j]+a[i],(dp[i-1][j-1]+5+a[i])/10*10);
                }
            } 
            __int64 ans=inf;
             for(int i=0;i<=d;i++)
             {
                ans=min(ans,(dp[n-1][i]+5+a[n])/10*10);
             } 
             printf("%I64d
    ",ans);
        }
        return 0;
    }
  • 相关阅读:
    AutoFac中常用方法说明
    DI之循环依赖
    NB/T 10215-2019 风力发电机组 测风传感器等最新能源行业标准
    DL/T 691-2019等最新电力行业标准
    TSG D7006-2020 压力管道监督检验规则
    YY/T 0595-2020 医疗器械 质量管理体系YY/T 0287-2017 应用指南
    GB/T 38775-2020系列电动汽车无线充电系统标准
    最新电动汽车安全标准
    GB 38032-2020 电动客车安全要求
    GB 38031-2020 电动汽车用动力蓄电池安全要求
  • 原文地址:https://www.cnblogs.com/NaCl/p/9580202.html
Copyright © 2011-2022 走看看