F.A.Qs Home ProblemSet Status Ranklist 1 Contest LoginRegister
Notice:1:五月份月赛定于5.27日12:30--17:30,鸣谢Claris主持!欢迎大家来玩! 2:关于OJ的注册可看https://www.lydsy.com/JudgeOnline/wttl/thread.php?tid=5671
大视野在线测评-欢迎您
[ New Thread ]
Problem 1201 >> 倍增法应该是可行的
test_tset @ 2016-09-28 09:25:59
[ Quote ] [ Edit ] [ Delete ] 1#
三角形 [i][j][(1<<k)] 是由 4个 (1<<(k-1))组成
test_tset @ 2016-09-28 09:28:30
[ Quote ] [ Edit ] [ Delete ] 2#
又是下标纠结啊。、。。
test_tset @ 2016-09-28 11:10:34
[ Quote ] [ Edit ] [ Delete ] 3#
糟糕,RMQ好像做不到O(1)啊。。。
nzhtl1477 @ 2016-09-28 15:51:21
[ Quote ] [ Edit ] [ Delete ] 4#
RBQ可以做到O( 1 )呀
xiaoyimi @ 2016-09-28 16:13:47
[ Quote ] [ Edit ] [ Delete ] 5#
RBQ……四楼很有想法
nietzsche @ 2017-11-29 15:51:36
[ Quote ] [ Edit ] [ Delete ] 6#
后排%学长,
bitset可以水,
O(n^3/64)
[Top] [Previous Page] [Next Page]

HOME Back