
树状数组
A_ice_
1111
展开
-
HDOJ 1166 敌兵布阵【模板】
敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 77389 Accepted Submission(s): 32623Problem DescriptionC国的死对头A国这段时间正在进行军事演习,所以原创 2016-08-12 17:46:32 · 323 阅读 · 0 评论 -
POJ 2299 Ultra-QuickSort【逆序数&&离散化】
Ultra-QuickSortTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 55493 Accepted: 20471DescriptionIn this problem, you have to analyze a particular sorting原创 2016-08-12 21:16:25 · 341 阅读 · 0 评论 -
HDOJ 1541 Stars
StarsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8425 Accepted Submission(s): 3369Problem DescriptionAstronomers often examin原创 2016-08-13 10:47:00 · 283 阅读 · 0 评论 -
HDOJ 1394 Minimum Inversion Number【求逆序数】
Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18008 Accepted Submission(s): 10945Problem DescriptionThe原创 2016-08-13 10:54:23 · 358 阅读 · 0 评论 -
LightOJ 1080 Binary Simulation【树状数组区间更新】
题目:LightOJ 1080 Binary Simulation这个题也很有意思。常规来说应该是用线段树做吧?不过我选的做法是树状数组。一般树状数组都是单点更新,区间查询。但是这个区间更新,单点查询也可以。具体原理怎么回事我不太明白,所以先贴一下。这个题是记录次数,翻转为偶数次的就不变,为奇数次的翻转。原创 2016-10-05 16:43:00 · 427 阅读 · 0 评论