
主席树
隔阂0323
加速零到一百公里
展开
-
Keen On Everything But Triangle HDU6601 主席树
Keen On Everything But TriangleTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 4646Accepted Submission(s): 523Problem Description...原创 2019-08-09 12:57:55 · 146 阅读 · 0 评论 -
D-query SPOJ - DQUERY 主席树/线段树离线处理
Given a sequence of n numbers a1, a2, ..., anand a number of d-queries. A d-query is a pair (i, j) (1 ≤ i ≤ j ≤ n). For each d-query (i, j), you have to return the number of distinct elements in the ...原创 2019-08-09 14:05:11 · 240 阅读 · 0 评论 -
HDU 3333 Turing Tree 主席树/线段树离线处理
After inventing Turing Tree, 3xian always felt boring when solving problems about intervals, because Turing Tree could easily have the solution. As well, wily 3xian made lots of new problems about int...原创 2019-08-09 14:18:47 · 272 阅读 · 0 评论 -
Super Mario HDU - 4417 主席树/线段树离线处理
Mario is world-famous plumber. His “burly” figure and amazing jumping ability reminded in our memory. Now the poor princess is in trouble again and Mario needs to save his lover. We regard the road to...原创 2019-08-09 14:32:58 · 140 阅读 · 0 评论 -
CodeForces 538F A Heap of Heaps 主席树
Andrew skipped lessons on the subject 'Algorithms and Data Structures' for the entire term. When he came to the final test, the teacher decided to give him a difficult task as a punishment.The teach...原创 2019-08-09 15:05:07 · 183 阅读 · 0 评论 -
K-th Closest Distance HDU - 6621 主席树+二分
K-th Closest DistanceTime Limit: 20000/15000 MS (Java/Others)Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 3305Accepted Submission(s): 1186Problem DescriptionYou hav...原创 2019-08-11 18:18:29 · 145 阅读 · 0 评论 -
2019牛客暑期多校训练营(第九场) H Cutting Bamboos 主席树+二分
链接:https://ac.nowcoder.com/acm/contest/889/H来源:牛客网时间限制:C/C++ 5秒,其他语言10秒空间限制:C/C++ 262144K,其他语言524288KSpecial Judge, 64bit IO Format: %lld题目描述There are n bamboos arranged in a line. The i-th...原创 2019-08-16 12:29:54 · 512 阅读 · 0 评论 -
Shooting HDU - 4866 主席树+思维
In the shooting game, the player can choose to stand in the position of [1, X] to shoot, you can shoot all the nearest K targets. The value of K may be different on different shootings. There are N ta...原创 2019-09-05 16:27:03 · 216 阅读 · 0 评论