2018 Multi-University, HDU Day 5

From EOJ Wiki
Jump to navigation Jump to search

卡常卡得真刺激。

Problem B

Solved by ultmaster. 01:15 (+)

题意：求一个数的所有只需要交换 $k$ 次以内的排列中，最小的和最大的。

题解：暴搜一下就好了。

Problem D

Unsolved. (-10)

Problem E

Solved by ultmaster. 00:49 (+)

Problem G

Solved by kblack. 00:57 (+)

题意：区间覆盖线段树，修改巨多，离线询问点值。

题解：一个区间按 ST 表拆成两个，按 ST 表更新反方向贡献回去就好了。

Problem H

Solved by ultmaster. 04:27 (+5)

Problem J

Unsolved. (-5)

Retrieved from "http://acm.ecnu.edu.cn/wiki/index.php?title=2018_Multi-University,_HDU_Day_5&oldid=631"