Cent Savings (DP) 分类: ACM dp 2015-08-0
来源:互联网 发布:php开发网站兼容问题 编辑:程序博客网 时间:2024/06/05 03:56
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 0X3f3f3f3fusing 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\n",ans); } return 0;}
版权声明:本文为博主原创文章,未经博主允许不得转载。
- Cent Savings (DP) 分类: ACM dp 2015-08-0
- Cent Savings (DP)
- UVALive6952 Cent Savings DP
- HNU Cent Savings (DP)
- uva 6952 Cent Savings dp
- CDOJ 1114 Cent Savings
- Cent Savings UVALive
- uvalive6952 - Cent Sa dp
- dp分类
- ACM DP训练专辑
- ACM&&树形DP
- 【算法 ACM DP】
- ACM 377. 护卫队(dp)
- ACM 概率DP hdu4336
- ACM POJ2533 简单dp
- acm 3 1008 dp
- ACM 数位DP
- ACM dp Cheapest Palindrome
- Delicious Apples(多校联合训练) 分类: ACM 多校 201
- Crazy Search(POJ1200) 分类: poj 2015-07-25 10:15 6
- HNU Knockout Racing 分类: ACM 2015-08-03 13:35 1人
- Joke with permutation 分类: ACM 2015-08-03 14:09 1
- Judging Troubles (multiset查找) 分类: ACM STL
- Cent Savings (DP) 分类: ACM dp 2015-08-0
- 背包问题------ 分类: ACM 2015-08-03 20:57 1人阅读 评论(0
- 最小生成树 克鲁斯卡尔(Kruskal)算法求最小生成树
- 优先队列实现哈弗曼最小权值
- 二维hash(Uva 12886)
- Concert Tour(Uvalive 6853)
- ACM数论中的常见的模板和结论
- 1279 扔盘子(51nod)
- 1278 相离的圆(51nod)