树状数组
wang_hoho
这个作者很懒,什么都没留下…
展开
-
HDU - 1394 - Minimum Inversion Number(树状数组、线段树)
Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21182 Accepted Submission(s): 12709Problem Description原创 2017-08-14 22:38:17 · 237 阅读 · 0 评论 -
ZOJ - 4046 - Good Permutation(树状数组逆序数)
ZOJ - 4046 - Good Permutation 题意:有一个含有n个元素的数列p,每个元素均不同且为1~n中的一个,求出将数列变为循环递增序列至少需要交换多少次每次交换只能交换相邻的两个数,循环递增数列就是当第 i 个数列为 a 则第 i+1 个数列为 a+1当a = n 时 下一个数 = 1 题解:因为只能相邻交换,又要变得有序,很容易就能想到逆序对数...原创 2018-07-18 10:22:50 · 566 阅读 · 0 评论 -
Codeforces Problem - 101B - Buses(树状数组|区间和)
题目链接题意:要从0站坐车到n站有m辆车 每辆车的起点为 si 站,终点为 ti 站上车后只能在终点站下车,但可以在非终点站上车求从0站到n站有几种乘车方案将车按终点排个序坐上第i辆车的方案数就是 [si,ti-1] 的乘车方案数,如果si=0则还要+1就是求区间和的问题要离散化#include <iostream>#include <string.h>#include...原创 2018-04-21 10:35:32 · 358 阅读 · 0 评论 -
HDU - 1255 - 覆盖的面积(线段树)
覆盖的面积Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6172 Accepted Submission(s): 3113Problem Description给定平面上若干矩形,求出被这些矩形覆盖原创 2017-08-30 13:59:55 · 313 阅读 · 0 评论 -
HDU - 1542 - Atlantis (线段树扫描线)
AtlantisTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15584 Accepted Submission(s): 6396Problem DescriptionThere are severa原创 2018-01-29 13:27:11 · 215 阅读 · 0 评论 -
HDU - 3450 - Counting Sequences (线段树|树状数组 + 离散化)
Counting SequencesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/65536 K (Java/Others)Total Submission(s): 2680 Accepted Submission(s): 952Problem DescriptionFor a se原创 2018-01-23 17:07:55 · 252 阅读 · 0 评论 -
HDU - 1166 - 敌兵布阵(树状数组、线段树)
敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 96925 Accepted Submission(s): 40988Problem DescriptionC国的死对头A国这段时间正在进行军事演原创 2017-08-13 11:33:27 · 182 阅读 · 0 评论 -
HDU - 4911 - Inversion(树状数组逆序数+离散化)
InversionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 5238 Accepted Submission(s): 1839Problem Descriptionbobo has a seq原创 2017-11-20 12:23:04 · 243 阅读 · 0 评论 -
HDU - 3584 - Cube (树状数组+容斥)
CubeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 2383 Accepted Submission(s): 1219Problem DescriptionGiven an N*N*N cube原创 2017-11-01 21:25:41 · 242 阅读 · 0 评论 -
HDU - 2852 - KiKi's K-Number(树状数组)
KiKi's K-NumberTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4158 Accepted Submission(s): 1875Problem DescriptionFor the k-原创 2017-08-13 10:39:31 · 231 阅读 · 0 评论 -
HDU - 6318 - Swaps and Inversions(逆序对数)
HDU - 6318 - Swaps and Inversions题意:可以花费 x 或 y 交换相邻的两个元素求将数列中所有的逆序对消除需要的最少花费 选xy中小的作为花费,消除所有的逆序对就是将序列排序,需要的交换次数就是逆序对数最后答案就是 逆序对数 * min (x, y) 可以用树状数组+离散化 或 归并排序来求出逆序对数(因为数的范围较大,所以在树状数组...原创 2018-07-26 20:48:08 · 189 阅读 · 0 评论