1300 peals
来源:互联网 发布:js向下取整 编辑:程序博客网 时间:2024/05/22 10:41
Pearls
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2395 Accepted Submission(s): 1166
Every month the stock manager of The Royal Pearl prepares a list with the number of pearls needed in each quality class. The pearls are bought on the local pearl market. Each quality class has its own price per pearl, but for every complete deal in a certain quality class one has to pay an extra amount of money equal to ten pearls in that class. This is to prevent tourists from buying just one pearl.
Also The Royal Pearl is suffering from the slow-down of the global economy. Therefore the company needs to be more efficient. The CFO (chief financial officer) has discovered that he can sometimes save money by buying pearls in a higher quality class than is actually needed. No customer will blame The Royal Pearl for putting better pearls in the bracelets, as long as the prices remain the same.
For example 5 pearls are needed in the 10 Euro category and 100 pearls are needed in the 20 Euro category. That will normally cost: (5+10)*10 + (100+10)*20 = 2350 Euro.
Buying all 105 pearls in the 20 Euro category only costs: (5+100+10)*20 = 2300 Euro.
The problem is that it requires a lot of computing work before the CFO knows how many pearls can best be bought in a higher quality class. You are asked to help The Royal Pearl with a computer program.
Given a list with the number of pearls and the price per pearl in different quality classes, give the lowest possible price needed to buy everything on the list. Pearls can be bought in the requested, or in a higher quality class, but not in a lower one.
22100 1100 231 101 11100 12
3301344
////题意 珠宝店到珍珠批发商进货 //// 第i种价格为p[i]的珍珠需要n个 // 则珍珠的结算价格为∑(n+10)*p[i] // 由于没种珍珠的数量结算时都要加上10 // 所以有时候把便宜的珍珠换为贵的结算价格反而变少了 // 给你一张购买清单 // 珍珠价格是递增的 // 每种珍珠都可以替换为比它贵的 // 求最少总花费////简单dp //令d[i]表示前i种珍珠的最少花费 // sum[i]表示第1种到第第i种的总数 // 那么有转移方程 // d[i]=min{d[j-1]+(sum[i]-sum[j-1]+10)*p[i]} // (sum[i]-sum[j-1]+10)*p[i]表示第j种到第i种珍珠全部替换为第i种#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int N = 105;int p[N], d[N], s[N],num, n, cas;int main(){ scanf ("%d", &cas); while (cas--) { scanf ("%d", &n); for (int i = 1; i <= n; ++i) { scanf ("%d%d", &num, &p[i]); s[i] = s[i - 1] + num; } memset(d,0x3f,sizeof(d)); d[0]=0; for (int i = 1; i <= n; ++i) for (int j = 1; j <= i; ++j) d[i] = min (d[i], d[j-1] + (s[i] - s[j - 1] + 10) * p[i]); printf ("%d\n", d[n]); } return 0;}
- 1300 peals
- UVALIVE 2675 Peals (POJ 1260 HDU 1300)
- problem 1300
- hdu 1300
- HDU 1300
- TFOJS-1300
- HDU 1300
- HDOJ 1300
- hdu 1300
- ZOJ-1300
- poj--1300
- 1201-1300
- hdu 1300
- 1300 竞赛报名
- 1300 Door Man
- LightOJ 1300 - Odd Personality
- hdu 1300 Pearls(dp)
- poj 1300 Door Man
- Eclipse和PyDev搭建完美Python开发环境
- Git常用命令
- 2016.08.19【初中部 NOIP普及组 】模拟赛题解
- Redis深入之路(十)
- 玲珑学院-ACM比赛1014 - Absolute Defeat
- 1300 peals
- unity crashlog
- 【poj 2228】 poj 2228 Naptime dp 环形dp的特殊处理
- html5视频截图实现
- unity导入模型相关
- 塔防游戏-摄像机移动
- 1087 Super Jumping! Jumping! Jumping!
- day1
- cron表达式