HDU 1963 && POJ 2063
来源:互联网 发布:淘宝买东西怎么收货 编辑:程序博客网 时间:2024/06/07 10:14
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
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
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
多次完全背包:用每一年的本息作为最大背包容量,股票的价格作为体积,利息作为价值
因为这句话→_→The value of a bond is always a multiple of $1 000.所以可以把本息与股票价格同时除以1000(背包体积与物品体积同时缩小),这样可以缩短时间。
#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>using namespace std;#define maxn 100050int dp[maxn];int main(){ int t, amount,year, d, value[11], bond[11], i, j, k, money, ans, temp; scanf("%d",&t); while(t--){ scanf("%d %d %d",&amount,&year, &d); for(i = 0; i < d; ++i){ scanf("%d %d", &value[i], &bond[i]); value[i] /= 1000; } ans = 0; temp = 0; for(k = 1; k <= year; ++k){ memset(dp, 0, sizeof(dp)); money = amount/1000; for(i = 0; i < d; ++i){ for(j = value[i]; j <= money; ++j){ dp[j] = max(dp[j], dp[j-(value[i])] + bond[i]); if(temp < dp[j]) temp = dp[j]; } } amount += temp; } printf("%d\n",amount); }}
- HDU 1963 && POJ 2063
- Investment(POJ-2063 && HDU-1963)
- HDU 2063 过山车+poj 1469
- hdu 1963 poj 2063 Investment(完全背包)
- poj hdu Tunnel Warfare
- hdu 1700 poj 2954
- poj 1177 && hdu 1828
- poj 3990 hdu 3694
- POJ 1466/HDU 1068
- hdu,poj 分类
- POJ 2238 && HDU 4294
- hdu 4009 && POJ 3164
- HDU 1043、POJ 1077
- 刷poj、hdu有感
- hdu 1540 && poj 2892
- hdu 1542 &&poj 1151
- hdu 1325 poj 1308
- poj 1503 hdu 1002
- java判断中文编码而后处理中文编码乱码问题
- 三、ArcGIS API for JavaScript之地图与图层(2)
- maven pom.xml文件详解
- 【Java编程】调用方法判断一个数是否是素数
- POJ 3073 Spam 笔记
- HDU 1963 && POJ 2063
- hdu1154(点是否在多边形内部、两线段交点)
- Effective C++(第3版)pdf
- CountDownLatch使用、源码浅析
- 使用QSerialport读取串口数据并处理
- UESTC
- 文章标题
- 队列
- Java优先级队列简单实现