树状数组
文章平均质量分 74
丘大路
这个作者很懒,什么都没留下…
展开
-
POJ3321:Apple Tree(树状数组)
Description There is an apple tree outside of kaka's house. Every autumn, a lot of apples will grow in the tree. Kaka likes apple very much, so he has been carefully nurturing the big apple tree.原创 2016-08-22 15:41:13 · 435 阅读 · 0 评论 -
POJ 2182 Lost Cows树状数组
Description N (2 <= N <= 8,000) cows have unique brands in the range 1..N. In a spectacular display of poor judgment, they visited the neighborhood 'watering hole' and drank a few too many beers be原创 2016-08-22 17:27:04 · 217 阅读 · 0 评论 -
HDU 1556 Color the ball(树状数组)
Description N个气球排成一排,从左到右依次编号为1,2,3....N.每次给定2个整数a b(a Input 每个测试实例第一行为一个整数N,(N 当N = 0,输入结束。 Output 每个测试实例输出一行,包括N个整数,第I个数代表第I个气球总共被涂色的次数。 Sample Input 3 1 1 2 2原创 2016-08-22 20:21:49 · 146 阅读 · 0 评论 -
poj 2352 && hdu 1541 Stars (树状数组)
Description Astronomers 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 that are原创 2016-08-22 20:31:34 · 223 阅读 · 0 评论 -
POJ 3067 Japan 树状数组
Description Japan 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 <原创 2016-08-23 13:12:35 · 164 阅读 · 0 评论 -
POJ 2299 Ultra-QuickSort 树状数组
Description In this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence elements until the seq原创 2016-08-23 13:57:36 · 166 阅读 · 0 评论 -
POJ 2481 Cows 树状数组
Description Farmer John's cows have discovered that the clover growing along the ridge of the hill (which we can think of as a one-dimensional number line) in his field is particularly good. Fa原创 2016-08-23 15:44:47 · 226 阅读 · 0 评论 -
HDU 1394 Minimum Inversion Number 树状数组
Description The inversion number of a given number sequence a1, a2, ..., an is the number of pairs (ai, aj) that satisfy i aj. For a given sequence of numbers a1, a2, ..., an, if we move the f原创 2016-08-23 16:58:14 · 158 阅读 · 0 评论 -
POJ 3468 A Simple Problem with Integers 树状数组解法
Description You have N integers, A1, A2, ... , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given interval. The other i原创 2016-08-25 14:05:58 · 226 阅读 · 0 评论