随笔分类 -  数据结构--贪心算法

摘要:题目链接 Problem Description You are a rich person, and you think your wallet is too heavy and full now. So you want to give me some money by buying a lov 阅读全文
posted @ 2017-07-18 22:01 茶飘香~ 阅读(422) 评论(0) 推荐(0)
摘要:题意:输入一个x,将x拆分成一些小的数(这些数不能相同,即x=a1+a2+...... ai!=aj when i!=j),然后这些数相乘得到一个成积(s=a1*a2*......),求最大的乘积s; 思路:考虑最简单的做法便是贪心,很明显将一个数分的越小,这个乘积越大,那么对于给的x 先找2+3+ 阅读全文
posted @ 2016-10-17 21:55 茶飘香~ 阅读(622) 评论(0) 推荐(0)
摘要:题目链接 http://acm.hdu.edu.cn/search.php?action=listproblem Problem Description Ladies and gentlemen, please sit up straight.Don't tilt your head. I'm se 阅读全文
posted @ 2016-10-04 12:58 茶飘香~ 阅读(429) 评论(0) 推荐(0)
摘要:题目链接 http://acm.hdu.edu.cn/showproblem.php?pid=4803 Problem Description Jenny is a warehouse keeper. He writes down the entry records everyday. The re 阅读全文
posted @ 2016-09-20 21:25 茶飘香~ 阅读(459) 评论(0) 推荐(0)
摘要:提交链接 http://codeforces.com/gym/100781/submit Description: Ada, Bertrand and Charles often argue over which TV shows to watch, and to avoid some of the 阅读全文
posted @ 2016-09-09 18:50 茶飘香~ 阅读(721) 评论(0) 推荐(0)
摘要:2016暑假多校联合 Windows 10(HDU:5802) Problem Description Long long ago, there was an old monk living on the top of a mountain. Recently, our old monk found 阅读全文
posted @ 2016-08-07 12:50 茶飘香~ 阅读(206) 评论(0) 推荐(0)
摘要:题目网址:http://codeforces.com/problemset/problem/416/CDescriptionInnovation technologies are on a victorious march around the planet. They integrate into... 阅读全文
posted @ 2015-12-05 20:58 茶飘香~ 阅读(180) 评论(0) 推荐(0)