poj2063 完全背包

Investment

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 10434		Accepted: 3668

Description

John never knew he had a grand-uncle, until he received the notary's letter. He learned that his late grand-uncle had gathered a lot of money, somewhere in South-America, and that John was the only inheritor. 
John did not need that much money for the moment. But he realized that it would be a good idea to store this capital in a safe place, and have it grow until he decided to retire. The bank convinced him that a certain kind of bond was interesting for him. 
This kind of bond has a fixed value, and gives a fixed amount of yearly interest, payed to the owner at the end of each year. The bond has no fixed term. Bonds are available in different sizes. The larger ones usually give a better interest. Soon John realized that the optimal set of bonds to buy was not trivial to figure out. Moreover, after a few years his capital would have grown, and the schedule had to be re-evaluated. 
Assume the following bonds are available: 

Value	Annual interest
4000 3000	400 250

With a capital of e10 000 one could buy two bonds of $4 000, giving a yearly interest of $800. Buying two bonds of $3 000, and one of $4 000 is a better idea, as it gives a yearly interest of $900. After two years the capital has grown to $11 800, and it makes sense to sell a $3 000 one and buy a $4 000 one, so the annual interest grows to $1 050. This is where this story grows unlikely: the bank does not charge for buying and selling bonds. Next year the total sum is $12 850, which allows for three times $4 000, giving a yearly interest of $1 200. 
Here is your problem: given an amount to begin with, a number of years, and a set of bonds with their values and interests, find out how big the amount may grow in the given period, using the best schedule for buying and selling bonds.

Input

The first line contains a single positive integer N which is the number of test cases. The test cases follow. 
The first line of a test case contains two positive integers: the amount to start with (at most $1 000 000), and the number of years the capital may grow (at most 40). 
The following line contains a single number: the number d (1 <= d <= 10) of available bonds. 
The next d lines each contain the description of a bond. The description of a bond consists of two positive integers: the value of the bond, and the yearly interest for that bond. The value of a bond is always a multiple of $1 000. The interest of a bond is never more than 10% of its value.

Output

For each test case, output – on a separate line – the capital at the end of the period, after an optimal schedule of buying and selling.

Sample Input

1
10000 4
2
4000 400
3000 250

Sample Output

14050

题意：

给出n,n组测试；

给出最初的本金，年数；

给出d,d组银行（物品）以及每组银行的存入钱数和利息（所占容量及价值）；

要求求出几年后的最大价值。

分析：

每年得到本金和后可以重新选取银行存款；

对于每一年，可以看做是完全背包求取每年最大利息；

同时题目中说明存入钱数为1000整倍数，因此将本金和每个银行存入钱数都除以1000进行优化，本金不是1000的整倍数也不会影响结果。

代码：

/*
* Filename:    code.cpp
* Created:     2017-02-20
* Author:        wyl6 
*[mail:17744454343@163.com]
* Desciption:  Desciption
*/
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <stack>
#include <queue>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <bitset>
#include <list>
#include <sstream>
#include <set>
#include <functional>
using namespace std;

#define INT_MAX 1 << 30
#define MAX 100
int n;
int amount,y;
int d;
int weight[12],value[12];
int dp[1000002];

int main(int argc, char const* argv[])
{
    scanf("%d",&n);
    while(n--){
        scanf("%d%d",&amount,&y);
        scanf("%d",&d);
        for (int i = 0; i < d; i += 1){
            scanf("%d%d",&weight[i],&value[i]);
            weight[i] /= 1000;
        }
        memset(dp,0,sizeof(dp));
        for (int i = 0; i < y; i += 1){
            int tem = amount/1000;
            for (int j = 0; j < d; j += 1){
                for (int k = weight[j]; k <= tem; k += 1){
                    dp[k] = max(dp[k],dp[k-weight[j]]+value[j]);
                }
            }
            amount += dp[tem]; 
        }
        printf("%d\n",amount);
    }
    return 0;
}