ACM__树状数组
文章平均质量分 74
Element-YoNg
每天晚上疲劳的睡在床上时,才感觉真真切切地过了一天。压力不是有人比你努力,而是比你牛逼几倍的人依然比你努力。即使看不到未来,也依然相信,自己选的人生错不了。第二天叫醒我的不是闹钟,其实,还是梦想。
展开
-
求逆序对 (树状数组版)
基本思想和线段树求解逆序数是一样的,前一篇《求逆序对 线段树版》也介绍过,先对输入数组离散,数组里的元素都不相同可以直接hash,存在相同的数话可以采用二分。离散化后对于每个f[i],找到f[i]+1~ n中的个数,也就是到i这个位置,一共有多少比f[i]大的数,统计之后在将f[i]的位置上的数量加1。这样一来统计的就是类似a[i]~n的和,可以想象成 把树状数组反过来统计,即统计的时候加原创 2014-08-18 14:53:05 · 1051 阅读 · 0 评论 -
HDU 1541 Stars (树状数组)
Problem DescriptionAstronomers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. Let the level of a star be an amount of the stars tha原创 2014-08-18 22:59:32 · 732 阅读 · 0 评论 -
HDU 3333 Turing Tree (离散化+离线处理+树状数组)
Problem DescriptionAfter 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 n原创 2014-08-20 10:51:56 · 775 阅读 · 0 评论 -
BZOJ 1452: [JSOI2009]Count (二维树状数组)
DescriptionInputOutputSample InputSample Output12HINT二维树状数组的简单应用,c数组的第一维坐标相当于哈希。如果是修改操作,修改前 将当前的值的个数以及祖先都减1, 修改后将个数加1.#include #include #include #i原创 2014-08-21 23:49:07 · 755 阅读 · 0 评论 -
POJ 1195 Mobile phones (二维树状数组)
DescriptionSuppose that the fourth generation mobile phone base stations in the Tampere area operate as follows. The area is divided into squares. The squares form an S * S matrix with the rows原创 2014-08-22 11:58:11 · 740 阅读 · 0 评论 -
HDU 3584 Cube (三维树状数组)
Problem DescriptionGiven an N*N*N cube A, whose elements are either 0 or 1. A[i, j, k] means the number in the i-th row , j-th column and k-th layer. Initially we have A[i, j, k] = 0 (1 <= i, j, k <原创 2014-08-23 00:16:20 · 943 阅读 · 0 评论 -
POJ 3067 Japan (树状数组)
DescriptionJapan plans to welcome the ACM ICPC World Finals and a lot of roads must be built for the venue. Japan is tall island with N cities on the East coast and M cities on the West coast (M <=原创 2014-08-24 23:25:15 · 537 阅读 · 0 评论 -
HDU 1754 I Hate It (线段树版 + 树状数组版)
Problem Description很多学校流行一种比较的习惯。老师们很喜欢询问,从某某到某某当中,分数最高的是多少。这让很多学生很反感。不管你喜不喜欢,现在需要你做的是,就是按照老师的要求,写一个程序,模拟老师的询问。当然,老师有时候需要更新某位同学的成绩。 Input本题目包含多组测试,请处理到文件结束。在每个测试的第一行,有两个正整数 N原创 2014-05-15 13:39:56 · 885 阅读 · 0 评论 -
CF #261 div2 D. Pashmak and Parmida's problem (树状数组版)
Parmida is a clever girl and she wants to participate in Olympiads this year. Of course she wants her partner to be clever too (although he's not)! Parmida has prepared the following test problem for原创 2014-08-19 00:32:26 · 1065 阅读 · 0 评论