二分法
文章平均质量分 89
闪光的可达鸭
这个作者很懒,什么都没留下…
展开
-
Trailing Zeroes (III)
Trailing Zeroes (III) LightOJ - 1138 You task is to find minimal natural number N, so that N! contains exactly Q zeroes on the trail in decimal notation. As you know转载 2017-09-07 12:47:15 · 195 阅读 · 0 评论 -
Monthly Expense
Monthly Expense POJ - 3273 Farmer John is an astounding accounting wizard and has realized he might run out of money to run the farm. He has already calculated and recorded the exact amount of mon原创 2017-09-15 16:32:39 · 208 阅读 · 0 评论 -
River Hopscotch
River Hopscotch POJ - 3258 Every year the cows hold an event featuring a peculiar version of hopscotch that involves carefully jumping from rock to rock in a river. The excitement takes place on a原创 2017-09-15 23:23:08 · 178 阅读 · 0 评论 -
超级赛亚ACMer
超级赛亚ACMer HDU - 5246 百小度是一个ACMer,也是一个超级赛亚人,每个ACMer都有一个战斗力,包括百小度。 所谓超级赛亚人的定义,是说如果在对抗中刚好接近极限状态,那就会激发斗志,实力提升. 具体来说,就是百小度现在要接受一些ACMer的挑战了,这些ACMer有n个人,第i个人的战斗力是a[i]。 百小度接下来可以自主安排与这n原创 2017-09-16 01:19:02 · 305 阅读 · 0 评论 -
序列变换
序列变换 HDU - 5248 给定序列A={A1,A2,...,An}A={A1,A2,...,An}, 要求改变序列A中的某些元素,形成一个严格单调的序列B(严格单调的定义为:BiBi+1,1≤iNBi)。 我们定义从序列A到序列B变换的代价为cost(A,B)=max(|Ai−Bi|)(1≤i≤N)cost(A,B)=max(|Ai−Bi|)(1≤i≤N)。 请求原创 2017-09-16 22:47:56 · 969 阅读 · 0 评论 -
Get the Containers
Get the Containers LightOJ - 1076 A conveyor belt has a number of vessels of different capacities each filled to brim with milk. The milk from conveyor belt is to be filled into 'm' containers. T原创 2017-09-19 14:02:12 · 425 阅读 · 0 评论 -
Hard Process
Hard Process CodeForces - 660C You are given an array a with n elements. Each element of a is either 0 or 1. Let's denote the length of the longest subsegment of consecutive el转载 2017-09-21 22:29:15 · 313 阅读 · 1 评论