HOJ Pearls-学习DP1

原创 2012年03月26日 21:43:09

Pearls

My Tags   (Edit)
  Source : ACM ICPC Northwestern European Regional 2002
  Time limit : 1 sec   Memory limit : 32 M

Submitted : 83, Accepted : 57

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

/*

 * File:   main.cpp
 * Author: Administrator
 *
 * Created on 2012年3月26日, 下午8:17
 */
#include <iostream>
#include <cstring>
#include <cmath>
#include <cstdio>
using namespace std;
const int MAX = 110;
int sum[MAX];
int price[MAX];
int dp[MAX];


/*
 * 首先对于POJ又多了一个认识,就是T用while输入的话会WA,这是为什么呢?不明白,其次对于这样
 * 一般的DP,算是多了一个DP的思想,把问题化成最优子问题,关键是子问题少而容易求的。此题的
 * 思路就是:先按从小到大的顺序将要处理的数据按价格排列(此题降低了难度而已经给好了),为什么
 * 保持从从小到大呢?原因很简单就是我们可以从第i位向前连续的并了,绝对不会出现跳跃的并。
 * 证明:如果出现跳跃的并的话,那么中间必然出现独立的环节,而他们的价格比i位的价格要低,因此
 * 跳跃就不是最优的方案,因此跳跃就不会成立。如此而来问题就变得很简单,将问题化为最有子问题时,
 * 变得简洁而明朗。
 */
int main() {
    int T;
    int n;
    scanf("%d", &T); /*居然用while写在POJ是WA,谨记啊!*/
    while (T--) {
        scanf("%d", &n);
        sum[0] = 0;
        int temp;
        for (int i = 1; i <= n; i++) {
            scanf("%d%d", &temp, &price[i]);
            sum[i] = sum[i - 1] + temp;
        }


        for (int i = 1; i <= n; i++) {
            dp[i] = (sum[i] + 10) * price[i];
            for (int j = 1; j < i; j++) {
                dp[i] = min(dp[j]+(sum[i] - sum[j] + 10) * price[i], dp[i]);
            }
        }
        printf("%d\n", dp[n]);
    }


    return 0;
}

贪心法 hoj1003

#include #include using namespace std; pairmilk[5001]; int main() {int m,n,i,j,k,minnum,minmoney,nee...
  • u013497977
  • u013497977
  • 2014年03月23日 15:41
  • 441

HOJ 1003题 题解

杭电OJ 1003题题目链接:点击打开链接      本题思路: 为了避免复杂的判断,将测试用例全部为负数的情况单独处理。   (1)如果某个测试用例全部为负数,则遍历数据,找到最大的数,记录下标,该...
  • xiaoyi357
  • xiaoyi357
  • 2016年07月23日 20:31
  • 424

dp1

LCS 二维vector的初始化:vector&lt;vector&lt;int &gt; &gt; vec(该维度数据格的个数,vector&lt;int&a...
  • qq_39370495
  • qq_39370495
  • 2018年02月10日 22:18
  • 9

HOJ 2662 Pieces Assignment(状态压缩DP)

题目特征: 1.求方法数目,告诉一堆约束条件(相邻,不攻击之类),其中有个数一般是 状态转移: 1.跟要相互影响的行有关,跟状态有关,跟给出条件有关(题目要求要达到一定数目等,但是不是具体说明一般不用...
  • booyoungxu
  • booyoungxu
  • 2015年07月23日 11:15
  • 1049

HOJ cake

Cake Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) ...
  • zl1085372438
  • zl1085372438
  • 2017年02月12日 17:28
  • 189

HOJ 1640 Mobile Phone

Mobile Phone My Tags   (Edit) Source : IOI 2001 Time limit : 5 sec...
  • HIT_Lingo
  • HIT_Lingo
  • 2016年03月10日 13:20
  • 334

Hoj 2662 棋盘问题

状态压缩dp,经典题目,好学好用的方法,让你满意的解释
  • wangjianbing1998
  • wangjianbing1998
  • 2016年08月10日 14:38
  • 426

哈工大hoj第1042题,动态规划

这道题我做了三次,调了三次,加起来有好几天的时间,一直没有做对,今天又研究了一天,终于在晚上21:44分AC了,痛苦之后很痛快!所以写一篇文章记录一下解决过程,也希望对大家有所帮助。        ...
  • jiadebin890724
  • jiadebin890724
  • 2012年06月22日 22:32
  • 1019

HOJ 2634 网络流 【蕴含式最大获利问题】

参考: 蕴含式最大获利问题。
  • chm517
  • chm517
  • 2014年07月18日 16:56
  • 327

HOJ 2634 最大权闭合子图

最大权闭合子图指的是对于n个点,选择每个点都必须选择其子结点,然后其子结点连接过去的箭头的全部点也必须选, 每个点有其自己的权值,有正也有负,问如何选子图可以使得权值和相加最大。 就有一个算法,把...
  • qq_36124802
  • qq_36124802
  • 2017年08月15日 00:45
  • 95
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HOJ Pearls-学习DP1
举报原因:
原因补充:

(最多只允许输入30个字)