随笔分类 -  基础---分块

沈阳网络赛J-Ka Chang【分块】【树状数组】【dfs序】
摘要：Given a rooted tree ( the root is node 11 ) of NN nodes. Initially, each node has zero point. Then, you need to handle QQ operations. There're two typ 阅读全文
posted @ 2018-09-19 20:26 wyboooo 阅读(250) 评论(0) 推荐(0)
hdu 6395Sequence【矩阵快速幂】【分块】
摘要：SequenceTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1951 Accepted Sub... 阅读全文
posted @ 2018-08-16 14:58 wyboooo 阅读(152) 评论(0) 推荐(0)