poj 1260(购买且是最后一个购买的dp问题)

Pearls

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 6786		Accepted: 3317

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

 

首先想到了一个简单的例子：

需求个数： 10      19     10

价值：       1500  2000  3000

 

在这个例子中，如果只选取后两种，显然最优方案是把2000的全都买成3000，也就是3000 * 39 = 117000

而算上第一个的话，显然最优方案并不是独立买1500 （117000 + 20*1500 = 147000）， 也不是把1500买成3000（3000*49 = 147000）。

而是把1500 买成2000， 2000依然是2000：（3000 * 20 + 2000 * 39 = 138000）。

因此不满足局部最优原理。

 

但事实上，有一些很重要的特征：

1、 最后一个一定原价购买（因为没有比它高价值的珍珠了）。

2、不能交叉连接：

比如不会存在如下情况：

1  2  3  4 （1去按照3的价格买， 2去按照4的价格买）。因为这个时候让2也去按3的价格买，一定比刚才那个更优。

 

因此设定 dp[i]为： 真实购买了第i个珍珠，且第i个珍珠是 最后一个购买的时的最小花费。

显然dp[n] 就是所求。

状态转移方程为：

dp[i] = min(dp[k] + (a[k+1] + a[k+2] + ... + a[i] + 10) * p[i]) 其中 k = [0, i-1]

dp[0] = 0;

初始化 dp[1] ~ dp[n] = oo;

 

提交记录：

1、Accepted 

/*Source Code

Problem: 1260  User: 775700879 
Memory: 700K  Time: 0MS 
Language: G++  Result: Accepted 

Source Code */
#include 
   
   
    
    
#include 
    
    
     
     
#include 
     
     
      
      
#include 
      
      
       
       
#define MAXW 7510
#define oo 0x3f3f3f3f
using namespace std;
struct pearl {
    int a, p;
};
pearl p[200] = {0};
int dp[200] = {0};
int main() {
    int t;
    cin >> t;
    while (t--) {
        int n;
        int i, j, k;
        cin >> n;
        for (i = 1; i <= n; i++) {
            cin >> p[i].a >> p[i].p;
        }
        dp[0] = 0;
        for (i = 1; i <= n; i++) {
            dp[i] = oo;
        }
        for (i = 1; i <= n; i++) {
            for (j = 0; j < i; j++) {
                int sum = dp[j];
                int count = 0;
                for (k = j + 1; k <= i; k++) {
                    count += p[k].a;
                }
                count += 10;
                sum += count * p[i].p;
                dp[i] = min(dp[i], sum);
            }
        }
        cout << dp[n] << endl;
    }
}