CTU Open Contest 2018

From EOJ Wiki
Revision as of 01:28, 12 October 2020 by Once (talk | contribs) (→‎Problem J)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Problem A

Solved by yanghong. 00:14 (+)

Problem B

Solved by Once. 01:52 (+1)

Problem C

Unsolved.

Problem D

Unsolved.

Problem E

Solved by bingoier. 03:31 (+1)

开两倍长度做一个后缀数组,二分查找即可。

Problem F

Solved by yanghong. 01:13 (+)

Problem G

Solved by Once. 02:24 (+2)

Problem H

Solved by yanghong. 02:04 (+)

Problem I

Unsolved.

Problem J

Solved by bingoier. 00:53 (+)

树形dp,对于每一位分别维护即可。