poj2063Investment【完全背包】
来源:互联网 发布:unity3d 点击物体 编辑:程序博客网 时间:2024/06/09 19:32
Language:
Investment
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 9653 Accepted: 3351
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
题意:给出一定的本金和存款年限和一些可供选择的存款方案每种存款方案需要一定的本金一年后获得相应的利息,求将本金存m年能获得的最大本息金额。
解题思路:完全背包,考虑到每种方案的存款金额都为1000的整数倍因此可同时除1000;
#include<cstdio>#include<cstdlib>#include<cstring>#include<algorithm>#include<cmath>#include<queue>using namespace std;const int maxn=50010;int dp[maxn];struct Node{int w,v;}A[15];int main(){int t,n,m,i,j,k,y;scanf("%d",&t);while(t--){scanf("%d%d%d",&n,&y,&m);for(i=0;i<m;++i){scanf("%d%d",&A[i].w,&A[i].v);A[i].w/=1000;}memset(dp,0,sizeof(dp));int ans=n;for(k=0;k<y;++k){n=ans/1000;for(i=0;i<m;++i){for(j=A[i].w;j<=n;++j){dp[j]=max(dp[j],dp[j-A[i].w]+A[i].v);}}ans+=dp[n];}printf("%d\n",ans);}return 0;}
0 0
- poj2063Investment【完全背包】
- POJ2063Investment
- 完全背包
- 完全背包
- 完全背包
- 完全背包
- 完全背包
- 完全背包!!
- 完全背包
- 完全背包
- 完全背包
- 完全背包
- 完全背包
- 完全背包
- 完全背包
- 完全背包
- 完全背包
- 完全背包
- export与source 一个shell脚本文件的关系
- 学习笔记------数据结构(C语言版) 扩展的线性单链表及归并
- 源码分析异步消息处理线程机制(Looper MessageQueue Handler Message)
- Android EventBus在Fragment中不起作用的解决方法
- iOS 【Multithreading-创建线程的方式/线程状态(了解)】
- poj2063Investment【完全背包】
- oracle 树状查询
- 关于android内存泄露那点事
- OC-1面试题
- IOS开发-几种截屏方法
- 可变参数求和
- Android平台下轻量级http网络传输库
- idea功能attach source
- realloc()使用中的需要注意的问题