Moscow Pre-Finals Workshop 2016 National Taiwan U Selection
Revision as of 14:05, 8 May 2019 by Xiejiadong (talk | contribs)
本来可以超 F0RE1GNERS 一题的, Xiejiadong 一番操作以后,差点签到都直接没了。
Problem A
Solved by Xiejiadong. 3:14 (+3)
题意:求一段子串里面子序列包含多少个不连续的 "easy" 。
题解:考虑倍增,用数组 $f[i][j]$ 表示位置 $i$ 之后的 $2^j$ 个 "easy" 的结束位置。
不需要考虑段与段之间连接的时候产生问题,这一点可以通过只考虑 "e" 作为开始的位置来证明。
暴力转移以后,每次贪心的取,不断的截取,获得答案即可。
明明可以暴力求幂的,偏要写快速幂,写了快速幂还写错了,身败名裂。
Problem B
Upsolved by Xiejiadong. (-3)
Problem C
Unsolved.
Problem D
Solved by Kilo_5723. 2:41 (+1)
Problem E
Unsolved.
Problem F
Solved by Weaver_zhu. 0:25 (+)
Problem G
Unsolved.
Problem H
Unsolved. (-1)
Problem I
Solved by Weaver_zhu. 3:34 (+4)
Problem J
Solved by Kilo_5723. 0:53 (+4)