hdu 2391 Filthy Rich

【hdu 2391 Filthy Rich】的更多相关文章

HDU 2391 Filthy Rich (dp)

题目连接 Problem Description They say that in Phrygia, the streets are paved with gold. You're currently on vacation in Phrygia, and to your astonishment you discover that this is to be taken literally: small heaps of gold are distributed throughout the…

单纯dp 水一处理时间点,第一行和第一列特殊处理: 其余的w[i][j]=show(w[i-1][j-1],w[i-1][j],w[i][j-1]); <span style="font-size:24px;"><span style="font-size:24px;">#include<stdio.h> #include<string.h> #include<algorithm> #include<…

hdu_2391 Filthy Rich DP

Filthy Rich Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4393 Accepted Submission(s): 1898 Problem Description They say that in Phrygia, the streets are paved with gold. You’re currently…

2015ACM/ICPC亚洲区长春站 A hdu 5527 Too Rich

Too Rich Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 245 Accepted Submission(s): 76 Problem Description You are a rich person, and you think your wallet is too heavy and full now. So yo…

HDU 5527 Too Rich

Too Rich Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 395 Accepted Submission(s): 118 Problem DescriptionYou are a rich person, and you think your wallet is too heavy and full now. So yo…

【算法系列学习】HDU 5527 Too Rich贪心

http://www.cnblogs.com/AOQNRMGYXLMV/p/4934747.html #include<iostream> #include<cstdio> #include<algorithm> using namespace std; ; const int inf=0x3f3f3f3f; int a[maxn]; int b[maxn]; ,,,,,,,,,}; int Solve(int t) { ; ;i>=;i--) { ||i==)…

HDU 5527 Too Rich 贪心

题意: 有\(10\)种面值为\(1, 5, 10, 20, 50, 100, 200, 500, 1000, 2000\)的纸币,现在你要选最多的数量凑成\(p\)块钱. 分析: 同样分析问题的反面:设总金额为\(sum\),我们来求凑成\(sum-p\)所需要的最少的张数.那么剩下的就是凑成\(p\)的最多的张数. 如果没有\(50\)和\(500\)的面值的话,那么后一种面值都是前一种面值的倍数,显然贪心是可以的. 贪心的理由就是完全可以用大面值替换掉对应数量的小面值的钱,这样总钱数不变但…