poj 2063 Investment 动态规划 完全背包问题
来源:互联网 发布:西安java薪资待遇如何 编辑:程序博客网 时间:2024/06/01 23:08
Investment
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 11256 Accepted: 3914
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:
ValueAnnual
interest4000
3000400
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.
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:
interest4000
3000400
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.
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
110000 424000 4003000 250
Sample Output
14050
Source
Northwestern Europe 2004
#include <algorithm>#include<iostream>#include<cstring>#include<string>#include<cmath>using namespace std;#define nsize 51200#define INF 0x3f3f3fint dp[nsize];int weight[20], value[20];int main() {int test;cin >> test;int w, y, n;while (test--){cin >> w >> y;cin >> n;fill(dp, dp + nsize, 0);for (int i = 0; i < n; i++) {cin >> weight[i] >> value[i];}for (int i = 0; i < n; i++) {weight[i] /= 1000;}int a;for (int k = 1; k <= y; k++) {for (int i = 0; i < n; i++) {a = w / 1000;for (int j = weight[i]; j <= a; j++) {dp[j] = max(dp[j], dp[j - weight[i]] + value[i]);}}w += dp[a];}cout << w << endl;}}
阅读全文
0 0
- poj 2063 Investment 动态规划 完全背包问题
- poj 2063 Investment 完全背包问题
- POJ 2063 Investment(完全背包问题)
- poj 2063 Investment 完全背包
- Poj 2063 Investment (完全背包)
- POJ 2063 Investment 完全背包
- poj 2063 Investment 完全背包
- poj 2063 Investment (完全背包)
- POJ 2063 Investment 完全背包
- POJ 2063 Investment 完全背包
- POJ 2063 Investment (完全背包)
- Investment 完全背包 POJ 2063
- POJ 2063 Investment (完全背包)
- POJ-2063--Investment (完全背包)
- POJ 2063 Investment(完全背包)
- POJ 2063 Investment(完全背包+)
- POJ 2063 Investment 完全背包
- Investment poj 完全背包
- java字符串自学
- 在centos上搭建redis集群并附测试(真集群非伪集群)
- 【Python】Matplotlib库(一)
- org.hibernate.HibernateException: No CurrentSessionContext configured!
- MySQL 安全机制
- poj 2063 Investment 动态规划 完全背包问题
- 观察者模式之通用代码(拉模型方式实现)
- LinuxC信号及信号处理(2)
- 2, 改善深层神经网络:超参数调试、正则化以及优化
- 2大文件查找命令实例
- 新手调试HTC vive经验分享
- Rootkit-LKM编程劫持系统调用,隐藏后门程序backdoor(ps,ls)
- 达维多定律与iPhone X
- 输入四个整数,要求按由小到大的顺序输出 if 实现