HDU 2063 Investment(多次完全背包)
来源:互联网 发布:悟空理财 知乎 编辑:程序博客网 时间:2024/04/30 19:37
Description
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 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
Sample Input
110000 424000 4003000 250
Sample Output
14050
这题很巧妙啊,不学dp的话还要用数学知识贪心模拟,,,
由于数据大需要压缩,然后每次用完全背包取最优
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <map>
#include <vector>
using namespace std;
const int N = 100100;
int dp[N];
int v[N], num[N];
int main()
{
int t;
scanf("%d", &t);
while(t--)
{
int m, y, n;
scanf("%d %d", &m, &y);
scanf("%d", &n);
for(int i=0;i<n;i++)
{
scanf("%d %d", &v[i], &num[i]);
v[i]/=1000;
}
int sum=m;
for(int i=0;i<y;i++)
{
memset(dp,0,sizeof(dp));
m=sum;
m/=1000;
for(int j=0;j<n;j++)
{
for(int k=v[j];k<=m;k++)
{
dp[k]=max(dp[k-v[j]]+num[j],dp[k]);
}
}
sum+=dp[m];
}
printf("%d\n",sum);
}
return 0;
}
- HDU 2063 Investment(多次完全背包)
- HDU 2063 Investment (完全背包)
- HDU 2063 Investment (完全背包+数据压缩)
- poj 2063 Investment 多次完全背包
- POJ2063 Investment(多次完全背包)
- HDU 2063 Investment 完全背包
- poj2063 Investment(多次完全背包)
- hdu 1963 poj 2063 Investment(完全背包)
- HDU 1963 Investment (完全背包)
- HDU 1963 Investment(完全背包)
- hdu 1963 Investment (完全背包)
- poj 2063& zoj 2224 Investment (多次完全背包)
- Investment(完全背包)
- hdu 1963 Investment(完全背包)
- HDU 1963(Investment)完全背包
- HDU 1963 Investment 完全背包
- hdu 1963 Investment 完全背包
- POJ 2063 Investment (完全背包)
- 网教28. 递归
- angularJS 学习记录
- 问题锦集
- ACM简单题目中对于连续多组输入的处理方法
- 如何将uboot里面的参数传给recovery或kernel
- HDU 2063 Investment(多次完全背包)
- UVA 1572 Self-Assembly
- outline使用方法,outline与border的区别
- Coding语言强弱类型的判定
- CSS滑动门
- linux设备驱动--wifi 模式
- UVa - 136 - Ugly Numbers(STL - 优先队列priority_queue)
- chrome浏览器调试JS的基本知识
- HTML+CSS基础 marquee标签实现图片从右往左移动(循环往复)