构造
Zeolim
这个作者很懒,什么都没留下…
展开
-
[构造]D. N Problems During K Days
Polycarp has to solve exactlynnproblems to improve his programming skill before an important programming competition. But this competition will be held very soon, most precisely, it will start ink...原创 2019-05-08 20:23:11 · 329 阅读 · 0 评论 -
[构造] F. Maximum Balanced Circle
There arennpeople in a row. The height of theii-th person isaiai. You can chooseanysubset of these people and try to arrange them into abalanced circle. Abalanced circleis such an order of ...原创 2019-05-08 21:46:50 · 246 阅读 · 0 评论 -
[trie][异或] hdu 6625 three arrays
先将题意转换为求A和B中的最小最优异或对并排序输出 所以可以建两颗trie并同时在两颗树内贪心跳转找最小异或对排序输出 贪心匹配可以建cnt数组记录当前节点个数,匹配时走过节点个数就直接减一 最优匹配顺序必然是先相同0 0 , 1 1 再不同 0 1 , 1 0 完! /* Zeolim - An AC a day keeps the bug away */ //pra...原创 2019-08-07 09:28:36 · 502 阅读 · 0 评论 -
19多校(十) Hilbert Sort
希尔伯特曲线如图所示 观察易得为分形 暴力分形过程很容易,但是时间爆炸 逆向思考,对于任意点,可以递归求得分型过程 (设 左上角为第1进入块左下2块 右下3块 右上4块) 且左上为原图形左旋, 下边两个都是原图形, 右上是原图形关于x = y对称 将以上分形过程做唯一映射并排序输出即可 有点卡常, vector string超时, 用5进制映射比较好 /* Zeolim...原创 2019-08-20 13:04:18 · 867 阅读 · 0 评论