F.A.Qs Home ProblemSet Status Ranklist Contest LoginRegister
Notice:祝各位Oier新年快乐,Rp++!
大视野在线测评-欢迎您
[ New Thread ]
Problem 3711 >> 这道题卡空间
DZYO @ 2018-01-14 21:23:33
[ Quote ] [ Edit ] [ Delete ] 1#
可以试试把线段树的节点改为 N*2+1e5 ,然后单点查询变为非递归,不然栈空间也会爆炸。。
[Top] [Previous Page] [Next Page]

HOME Back