![](https://img-blog.csdnimg.cn/20201014180756923.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
DP
文章平均质量分 85
什么样的小孩
欢迎各位大佬和我一起交流算法,指正不足,共同进步!
展开
-
HDU - 1024 Max Sum Plus Plus
Max Sum Plus Plus Now I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves to more difficult problems. Now you are faced with a more原创 2017-08-20 17:32:43 · 115 阅读 · 0 评论 -
HDU - 1087 Super Jumping! Jumping! Jumping!
Super Jumping! Jumping! Jumping! Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this game, so I原创 2017-08-20 17:45:10 · 126 阅读 · 0 评论 -
HDU - 1176 免费馅饼
免费馅饼 都说天上不会掉馅饼,但有一天gameboy正走在回家的小径上,忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了,这馅饼别处都不掉,就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了,所以gameboy马上卸下身上的背包去接。但由于小径两侧都不能站人,所以他只能在小径上接。由于gameboy平时老呆在房间里玩游戏,虽然在游戏中是个身手敏捷的高手,但在现实中原创 2017-08-20 17:48:55 · 147 阅读 · 0 评论 -
HDU - 1260 Tickets
Tickets Jesus, what a great movie! Thousands of people are rushing to the cinema. However, this is really a tuff time for Joe who sells the film tickets. He is wandering when could he go back h原创 2017-08-20 17:56:07 · 322 阅读 · 0 评论 -
HDU - 1160 FatMouse's Speed
FatMouse's Speed FatMouse believes that the fatter a mouse is, the faster it runs. To disprove this, you want to take the data on a collection of mice and put as large a subset of this data as原创 2017-08-20 18:01:20 · 266 阅读 · 0 评论 -
POJ - 1458 Common Subsequence
Common Subsequence A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = another sequence Z = is a subsequence of X if there原创 2017-08-20 18:05:45 · 117 阅读 · 0 评论 -
HDU - 1078 FatMouse and Cheese
FatMouse and Cheese FatMouse has stored some cheese in a city. The city can be considered as a square grid of dimension n: each grid location is labelled (p,q) where 0 <= p < n and 0 <= q < n. At e原创 2017-08-20 18:15:45 · 286 阅读 · 0 评论 -
POJ - 3186 Treats for the Cows
Treats for the Cows FJ has purchased N (1 <= N <= 2000) yummy treats for the cows who get money for giving vast amounts of milk. FJ sells one treat per day and wants to maximize the money he receives原创 2017-08-20 20:15:59 · 172 阅读 · 0 评论