差分
clover_hxy
The secret oppotunities are hidden inside every failure....
展开
-
bzoj 3626: [LNOI2014]LCA(树链剖分+离线+差分)
3626: [LNOI2014]LCATime Limit: 10 Sec Memory Limit: 128 MBSubmit: 1512 Solved: 563[Submit][Status][Discuss]Description给出一个n个节点的有根树(编号为0到n-1,根节点为0)。一个点的深度定义为这个节点到根的距离+1。设dep[i]表示点i的深度,L原创 2016-05-12 14:03:34 · 705 阅读 · 1 评论 -
BestCoder Round #91
Lotus and Characters Accepts: 150 Submissions: 897 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/131072 K (Java/Others)问题描述Lotus有nn种字母,给出每种字母的价值以及每种字母的个数限制,她原创 2017-01-22 16:35:12 · 554 阅读 · 0 评论