上一页 1 ··· 74 75 76 77 78 79 80 81 82 ··· 88 下一页
摘要: set排序: 阅读全文
posted @ 2017-03-16 23:07 Angel_Kitty 阅读(225) 评论(0) 推荐(0)
摘要: 树的重心(树的重心定义为:找到一个点,其所有的子树中最大的子树节点数最少,那么这个点就是这棵树的重心) 阅读全文
posted @ 2017-03-16 23:05 Angel_Kitty 阅读(252) 评论(0) 推荐(0)
摘要: Problem A: pigofzhou的巧克力棒 Description 众所周知,pigofzhou有许多妹子。有一天,pigofzhou得到了一根巧克力棒,他想把这根巧克力棒分给他的妹子们。具体地,这根巧克力棒长为 n,他想将这根巧克力棒折成 n 段长为 1 的巧克力棒,然后分给妹子们。 但是 阅读全文
posted @ 2017-03-16 20:33 Angel_Kitty 阅读(654) 评论(0) 推荐(0)
摘要: NPY and shot Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1035 Accepted Submission(s): 428 Pr 阅读全文
posted @ 2017-03-15 22:43 Angel_Kitty 阅读(321) 评论(0) 推荐(0)
摘要: 托一个学弟的福,学了一下他的最简便三分写法,然后找了一道三分的题验证了下,AC了一题,写法确实方便,还是我太弱了,漫漫AC路!各路大神,以后你们有啥好的简便写法可以在博客下方留个言或私信我,谢谢了! Turn the corner Time Limit: 3000/1000 MS (Java/Oth 阅读全文
posted @ 2017-03-15 17:45 Angel_Kitty 阅读(372) 评论(1) 推荐(0)
摘要: 题目描述: 在周长10000的圆上,初始等距的放置着n个雕塑,现在新加入m个雕塑,要使得这n+m个雕塑仍然等距,问原来n个雕塑要移动的距离总和的最小值. 原题地址: http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=15133 分 阅读全文
posted @ 2017-03-14 22:14 Angel_Kitty 阅读(362) 评论(0) 推荐(0)
摘要: I Hate It Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 70863 Accepted Submission(s): 27424 Pr 阅读全文
posted @ 2017-03-13 22:51 Angel_Kitty 阅读(352) 评论(5) 推荐(0)
摘要: Spreading the Wealth Problem A Communist regime is trying to redistribute wealth in a village. They have have decided to sit everyone around a circula 阅读全文
posted @ 2017-03-13 16:41 Angel_Kitty 阅读(345) 评论(0) 推荐(0)
摘要: Uva 11729 Commando War (简单贪心) There is a war and it doesn't look very promising for your country. Now it's time to act. You have a commando squad at y 阅读全文
posted @ 2017-03-13 15:29 Angel_Kitty 阅读(380) 评论(0) 推荐(0)
摘要: Problem C: The Dragon of Loowater Once upon a time, in the Kingdom of Loowater, a minor nuisance turned into a major problem. The shores of Rellau Cre 阅读全文
posted @ 2017-03-12 22:39 Angel_Kitty 阅读(368) 评论(0) 推荐(0)
上一页 1 ··· 74 75 76 77 78 79 80 81 82 ··· 88 下一页