![](https://img-blog.csdnimg.cn/20201014180756757.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
贪心
天心流月
这个作者很懒,什么都没留下…
展开
-
[Codeforces #608 div2]1271D Portals
Description You play a strategic video game (yeah, we ran out of good problem legends). In this game you control a large army, and your goal is to conquer nnn castles of your opponent. Let’s describe ...原创 2019-12-17 16:33:45 · 513 阅读 · 0 评论 -
[Codeforces #608 div2]1271C Shawarma Tent
Description The map of the capital of Berland can be viewed on the infinite coordinate plane. Each point with integer coordinates contains a building, and there are streets connecting every building t...原创 2019-12-17 15:16:16 · 342 阅读 · 0 评论 -
[Codeforces #608 div2]1272B Blocks
Description There are nnn blocks arranged in a row and numbered from left to right, starting from one. Each block is either black or white. You may perform the following operation zero or more times: ...原创 2019-12-17 14:51:06 · 317 阅读 · 0 评论 -
[Codeforces #608 div2]1271A Suits
Description A new delivery of clothing has arrived today to the clothing store. This delivery consists of aaa ties,bbb scarves,ccc vests and ddd jackets. The store does not sell single clothing items ...原创 2019-12-17 12:53:29 · 263 阅读 · 0 评论 -
[洛谷Luogu]P1803 线段覆盖问题
贪心想法题解的各位dalaodalaodalao都讲得很清楚了,在下就提供一种桶排的做法吧。 因为给出数据范围 0≤ai<bi≤10000000≤ai<bi≤10000000≤ai<bi≤1000000 可以想到使用桶排的方式优化。即从快排的O(nlogn)O(nlogn)O(nlogn)的复杂度降低到了O(n)O(n)O(n)的复杂度。 需要考虑的问题 快排是依照右端点直接排序后遍历所有线段,因...原创 2019-11-27 16:06:30 · 192 阅读 · 0 评论