POJ1260 Pearls(DP)
来源:互联网 发布:绝地求生枪械数据最新 编辑:程序博客网 时间:2024/05/20 18:50
Pearls
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9494 Accepted: 4823
Description
In Pearlania everybody is fond of pearls. One company, called The Royal Pearl, produces a lot of jewelry with pearls in it. The Royal Pearl has its name because it delivers to the royal family of Pearlania. But it also produces bracelets and necklaces for ordinary people. Of course the quality of the pearls for these people is much lower then the quality of pearls for the royal family.In Pearlania pearls are separated into 100 different quality classes. A quality class is identified by the price for one single pearl in that quality class. This price is unique for that quality class and the price is always higher then the price for a pearl in a lower quality class.
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.
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.
Input
The first line of the input contains the number of test cases. Each test case starts with a line containing the number of categories c (1<=c<=100). Then, c lines follow, each with two numbers ai and pi. The first of these numbers is the number of pearls ai needed in a class (1 <= ai <= 1000).
The second number is the price per pearl pi in that class (1 <= pi <= 1000). The qualities of the classes (and so the prices) are given in ascending order. All numbers in the input are integers.
The second number is the price per pearl pi in that class (1 <= pi <= 1000). The qualities of the classes (and so the prices) are given in ascending order. All numbers in the input are integers.
Output
For each test case a single line containing a single number: the lowest possible price needed to buy everything on the list.
Sample Input
22100 1100 231 101 11100 12
Sample Output
3301344
Source
Northwestern Europe 2002
题意:有n个等级的珍珠,其等级和价值都是递增的,每买一种等级的珍珠要多买十颗,低等级的珍珠可以由高等级的来代替,问最少花费
#include <bits/stdc++.h>using namespace std;int t, n;int a[101], p[101], dp[101], sum[101];int main(){ scanf("%d", &t); while(t--){ scanf("%d", &n); for(int i = 1; i <= n; i++){ scanf("%d%d", &a[i], &p[i]); sum[i] = a[i] + sum[i-1]; } for(int i = 1; i <= n; i++){ dp[i] = dp[i-1] + (a[i] + 10) * p[i]; for(int j = 0; j < i; j++){ dp[i] = min(dp[i], dp[j] + (sum[i] - sum[j] + 10) * p[i]); } } printf("%d\n", dp[n]); }}总结 :这题的关键是珍珠之间的替代必然是连续的,即第n级珍珠若能代替第n - i级,则其必定能代替 n - i + 1级、n - i + 2级 ... n - 1级的所有珍珠
阅读全文
0 0
- POJ1260 Pearls(DP)
- poj1260 Pearls(Dp)
- poj1260——Pearls(dp)
- POJ1260 Pearls DP
- Pearls poj1260 (DP)
- poj1260 Pearls (dp)
- POJ1260-Pearls(dp)
- [poj1260] Pearls DP斜率优化
- 【POJ1260】Pearls (动态规划)
- poj1260--Pearls(dp,从一开始就想错了......)
- 【POJ1260】【斜率优化DP】Pearls题解
- POJ1260--Pearls
- poj1260 Pearls
- poj1260 Pearls
- POJ1260 Pearls
- poj1260 pearls
- poj1260 Pearls
- poj1260 Pearls
- JavaScript中的闭包
- poj 3422 最小费用流 Bellman-Ford 拆点
- Android Framework--事件分发
- Nginx----正向代理和反向代理的区别
- 解决phpStudy集成环境下 , 项目运行稍慢的问题
- POJ1260 Pearls(DP)
- 使用Debug Diagnostic Tool排除内存泄漏故障
- mysql 存储过程的见解
- progressActivity包裹swpielayout出现包裹内容无法隐藏问题
- 封装弹性dialog框架,使用只需一行代码
- Eclipse实用快捷键大全
- 【nginx-rtmp】09、指令(Directives)之 记录(Record)
- Win7x64+VS2012+OpenCV2.4.3+CMake2.8.10+TBB41重编译OpenCV
- 极大似然估计解释最小二乘