随笔分类 -  数据结构-树状数组

ZOJ-2386 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 阅读全文
posted @ 2017-05-15 22:59 Robin! 阅读(230) 评论(0) 推荐(0)
BZOJ-1103 [POI2007]大都市meg 【DFS序+树状数组】
摘要：Description 在经济全球化浪潮的影响下,习惯于漫步在清晨的乡间小路的邮递员Blue Mary也开始骑着摩托车传递邮件了。 不过，她经常回忆起以前在乡间漫步的情景。昔日，乡下有依次编号为1..n的n个小村庄，某些村庄之间有一些双 向的土路。从每个村庄都恰好有一条路径到达村庄1（即比特堡）。并 阅读全文
posted @ 2017-04-01 19:00 Robin! 阅读(227) 评论(0) 推荐(0)
HDU-3333 Turing Tree 【树状数组+离线处理+离散化】
摘要：Problem Description After inventing Turing Tree, 3xian always felt boring when solving problems about intervals, because Turing Tree could easily have 阅读全文
posted @ 2017-03-24 13:20 Robin! 阅读(134) 评论(0) 推荐(0)
BZOJ-2743 [HEOI2012]采花 【树状数组+离线处理】
摘要：Description 萧芸斓是Z国的公主，平时的一大爱好是采花。 今天天气晴朗，阳光明媚，公主清晨便去了皇宫中新建的花园采花。花园足够大，容纳了n朵花，花有c种颜色（用整数1-c表示），且花是排成一排的，以便于公主采花。公主每次采花后会统计采到的花的颜色数，颜色数越多她会越高兴！同时，她有一癖好， 阅读全文
posted @ 2017-03-23 22:06 Robin! 阅读(125) 评论(0) 推荐(0)
POJ-3321 Apple Tree 【DFS序+树状数组】
摘要：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 阅读全文
posted @ 2017-03-12 21:57 Robin! 阅读(114) 评论(0) 推荐(0)
UVALive-2926 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 阅读全文
posted @ 2017-03-09 18:13 Robin! 阅读(157) 评论(0) 推荐(0)
POJ-1195 Mobile phones 【树状数组+二维】
摘要：Description Suppose that the fourth generation mobile phone base stations in the Tampere area operate as follows. The area is divided into squares. Th 阅读全文
posted @ 2017-03-08 13:34 Robin! 阅读(154) 评论(0) 推荐(0)
POJ-2352 Stars【树状数组】
摘要：Description Astronomers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. Let the leve 阅读全文
posted @ 2017-03-06 19:21 Robin! 阅读(103) 评论(0) 推荐(0)
树状数组模板
摘要：1 #include 2 using namespace std; 3 const int maxn = 1000 + 5; 4 int C[maxn], n; 5 6 int lowbit(int x) {return x & -x;} 7 8 int sum(int x) { 9 int ret = 0; 10 while(x) { 11 ... 阅读全文
posted @ 2017-03-06 10:47 Robin! 阅读(198) 评论(0) 推荐(0)