可持久化线段树
LaLaLa112138
这个作者很懒,什么都没留下…
展开
-
POJ 2104 K-th Number 可持久化线段树
K-th NumberTime Limit: 20000MS Memory Limit: 65536K Total Submissions: 58315 Accepted: 20211 Case Time Limit: 2000MS DescriptionYou are working for Macrohard company in data structures de原创 2017-07-27 20:31:18 · 370 阅读 · 0 评论 -
BZOJ 3524 Couriers 可持久化线段树
3524: [Poi2014]CouriersTime Limit: 20 Sec Memory Limit: 256 MB Submit: 2310 Solved: 894 [Submit][Status][Discuss]Description给一个长度为n的序列a。1≤a[i]≤n。 m组询问,每次询问一个区间[l,r],是否存在一个数在[l,r]中出现的次数大于(r-l+1)/2。原创 2017-08-01 11:20:25 · 347 阅读 · 0 评论 -
HDU 3333 Turing Tree 可持久化线段树
Turing TreeTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5415 Accepted Submission(s): 1921Problem DescriptionAfter inventing Turing Tree,原创 2017-07-28 09:02:47 · 321 阅读 · 0 评论