POJ 1260 DP解题报告
来源:互联网 发布:振动分析软件 航空 编辑:程序博客网 时间:2024/06/05 02:23
Pearls
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 9285 Accepted: 4681
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.
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.
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
2
2
100 1
100 2
3
1 10
1 11
100 12
Sample Output
330
1344
【解题报告】
本来是想写斜率优化的,结果暴力都是0ms,怒岂止。
代码如下:
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;#define N 1010int a[N],sum[N],p[N],dp[N];int n,t;int main(){ for(scanf("%d",&t);t;--t) { memset(sum,0,sizeof(0)); scanf("%d",&n); for(int i=1;i<=n;++i) { scanf("%d%d",&a[i],&p[i]); sum[i]=sum[i-1]+a[i]; } dp[0]=0; for(int i=1;i<=n;++i) { dp[i]=(a[i]+10)*p[i]+dp[i-1]; 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]); } return 0;}
让我看到你们的双手
- Poj 1260 DP 解题报告
- POJ 1260 DP解题报告
- POJ 1160 DP 解题报告
- POJ 1260 Pearls ACM解题报告(区间dp)
- 状态压缩DP POJ 1699解题报告
- [dp]POJ 3176 Cow Bowling解题报告
- [dp]POJ 2229 Sumsets 解题报告
- POJ 3252 数位DP 解题报告
- POJ 2096 概率DP 解题报告
- poj 2096 概率DP 解题报告
- poj 2096 期望DP 解题报告
- poj 1417 True Liars 解题报告 并查集 DP
- poj 2441Arrange the Bulls解题报告-状态压缩dp
- poj 2288 Islands and Bridges解题报告-状态压缩dp
- POJ 1739 Tony's Tour 解题报告(插头DP)
- POJ 3133 Manhattan Wiring 解题报告(插头DP)
- POJ 3356 AGTC 解题报告(Edit Distance,DP)
- POJ 1463 Strategic game (树形DP) 解题报告
- gradle基础讲解系列1
- django学习10 数据库 增删改查 简单方法
- LiteOS学习第七篇——系统滴答
- android 编译错误 Error:(1, 0) Plugin with id 'com.android.application' not found. 解决
- CSDN-markdown编辑器使用方法
- POJ 1260 DP解题报告
- 欢迎使用CSDN-markdown编辑器
- 修改百位上的值(难度系数:半颗星)
- sublime text 3 + python配置,完整搭建及常用插件安装
- Android 通知(Notification)的使用
- utf-8和GBk的区别
- Java基础--控制语句
- 51单片机与protues仿真联合基础教程(一)--创建工程
- 队列学习