
树状数组
DrWells
OIer@sxyz,ACMer@CSU,ACCAer@HNU,AIer@RUC,中国宝可梦科学院院士,人生无限公司精神股东
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
HDU - 2492Ping pong(树状数组|权值线段树)
Ping pongTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5424 Accepted Submission(s): 2020Problem Description N(3<=N<=20000) ping pong play原创 2017-08-16 14:47:39 · 344 阅读 · 0 评论 -
HDU-3333-Turing Tree(离线+哈希+树状数组|线段树)
Turing TreeTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5508 Accepted Submission(s): 1967Problem Description After inventing Turing Tree原创 2017-08-16 15:00:04 · 272 阅读 · 0 评论 -
POJ-2299Ultra-QuickSort(BIT|归并排序求逆序对)
Ultra-QuickSort Time Limit: 7000MS Memory Limit: 65536K Total Submissions: 62659 Accepted: 23342 DescriptionIn this problem, you have to analyze a particular sorting algorithm. The algor原创 2017-08-14 13:20:05 · 180 阅读 · 0 评论 -
POJ-2352Stars(BIT|归并排序求逆序对)
Stars Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 48588 Accepted: 20999 DescriptionAstronomers often examine star maps where stars are represented by points on a plane and原创 2017-08-14 13:23:46 · 260 阅读 · 0 评论 -
51Nod-1711平均数(二分+树状数组|线段树)
1711 平均数 基准时间限制:4 秒 空间限制:131072 KB 分值: 80 难度:5级算法题 LYK有一个长度为n的序列a。 他最近在研究平均数。 他甚至想知道所有区间的平均数,但是区间数目实在太多了。 为了方便起见,你只要告诉他所有区间(n*(n+1)/2个区间)中第k大的平均数就行了。 Input 第一行两个数n,k(1<=n<=100000,1<=k<=n*(n+1)/2原创 2017-08-14 13:44:03 · 393 阅读 · 0 评论 -
HDU2852-KiKi's K-Number(树状数组+二分|权值线段树)
KiKi’s K-NumberTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4163 Accepted Submission(s): 1878Problem Description For the k-th number, we原创 2017-08-14 13:54:02 · 346 阅读 · 0 评论 -
HDU5775-Bubble Sort(逆序对)
Bubble SortTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1542 Accepted Submission(s): 811Problem Description P is a permutation of the in原创 2017-08-14 13:58:13 · 214 阅读 · 0 评论