ACM之二分
文章平均质量分 84
PK0071
这个作者很懒,什么都没留下…
展开
-
2007年北欧ACM比赛A题(最小值最大,二分)
Problem A - AssembleTime limit: 2 secondsRecently your team noticed that the computer you use to practice for programming contests is not good enough anymore. Therefore, you decide to buy a new co原创 2013-12-08 00:08:07 · 1550 阅读 · 0 评论 -
UVa11384正整数序列(递归,二分)
题目大意:有一个从1、2、3、.......n的正整数数列,现在要通过若干次操作将这个数列全部变为0,操作的方法是每次选取任意1个或多个任意位置的数,然后将这几个数同时减去一个一个数。问至少要经过多少次操作才能让数列全部变为0思路:在纸上试几个数就可以发现,比如6时,456同时减去4这个中间数,剩下123012其实只取决于123这部分f(6) = f(3) + 1。原创 2013-12-08 00:06:47 · 1246 阅读 · 0 评论 -
2006 ACM Northwestern European Programming Contest C题(二分求最大)
My birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I have a numberN of them, of various tastes and of various sizes. F of my friends are coming to my party and each of原创 2013-12-08 22:59:46 · 998 阅读 · 0 评论 -
04年中欧ACM比赛
Beijing was once surrounded by four rings of city walls: the Forbidden City Wall, the Imperial City Wall, the Inner City Wall, and finally the Outer City Wall. Most of these walls were demolished in t原创 2013-12-21 00:46:11 · 1210 阅读 · 0 评论