poj 1260 Pearls

Pearls Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 8841   Accepted: 4422 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 Source Northwestern Europe 2002

/*转载请注明出处:http://user.qzone.qq.com/289065406/blog/1300164274

大致题意：

给出几类珍珠，以及它们的单价，要求用最少的钱就可以买到相同数量的，相同（或更高）质量的珍珠。

【规定买任一类的珍珠n个(价格为p)，都要支付(n+10)*p的钱，即额外支付10*p】

 

例如样例Input的第二个例子：

3

1 10

1 11

100 12

需要买第一类1个，第二类1个，第三类100个

按常规支付为 (1+10)*10 + (1+10)*11 + (100+10)*12 = 1551元（一共买了102个珍珠）

但是如果全部都按照第三类珍珠的价格支付，同样是买102个，而且其中总体质量还被提高了，但是价格却下降了：(102+10)*12 = 1344元

 

而对于样例Input的第一个例子：

2

100 1

100 2

按常规支付为 （100+10）*1 + (100+10)*2 =330元

但是全部按第二类珍珠的价格支付，同样买200个，虽然总体质量提升了，但是价格也提高了： (202+10)*2=424元

 

本题关键点在于：

（1）       要求要买的珍珠的数量是一定的

（2）       所买的珍珠的质量允许提高，但不允许下降（即可以用高质量珍珠替代低质量）

（3）       输入时，后输入的珍珠价格一定比前面输入的要贵

（4）       由（2）（3）知，珍珠的替代必须是连续的，不能跳跃替代（这个不难证明，因为假如用第i+2类去替代第i类珍珠，会使最终的支付价格降低，那么用第i+1类去替代第i类珍珠会使最终的支付价格更加低）

令dp[i]表示在已知第i类珍珠时,所需支付的最低价格

则状态方程为：

dp[i]=(a[i]+10)*p[i]+dp[i-1];  //当第i种珍珠出现时，未优化价格的情况

dp[i]=min(dp[i],(sum[i]-sum[j]+10)*p[i]+dp[j]);  //枚举j，价格优化(sum[i]代表0~i所需要的珍珠数)

*/

代码如下：

#include <cstring>
#include <cstdio>
#include <algorithm>
#include <iostream>
using namespace std;

int n;
struct node
{
    int num;
    int mon;
}a[1002];
int sum[1002];
int dp[1002];

int Minmon()
{
    memset(dp, 0, sizeof(dp));
    int i, j;
    for ( i = 1; i <= n; i++ )
    {
        dp[i] = dp[i-1]+(a[i].num+10)*a[i].mon;
        for ( j = 0;j <  i; j++ )
        {
            dp[i] = min(dp[i], dp[j]+(sum[i]-sum[j]+10)*a[i].mon);
        }
    }
    return dp[n];
}

int main()
{
    int i, t;
    scanf ( "%d", &t );
    while ( t-- )
    {
        scanf ( "%d", &n );
        for ( i = 1;i <= n; i++ )
        {
            scanf ( "%d %d", &a[i].num, &a[i].mon );
            if ( i == 1 )
                sum[i] = a[i].num;
            else
                sum[i] = sum[i-1]+a[i].num;
        }
        int su = Minmon();
        printf ( "%d\n", su );
    }
}

代码菜鸟，如有错误，请多包涵！！！

如果有帮助记得支持我一下，谢谢！！！