随笔分类 -  树状数组

hdu 3030 Increasing Speed Limits (离散化+树状数组+DP思想)
摘要：Increasing Speed LimitsTime Limit: 2000/10000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 481Accepted Submission(s):... 阅读全文
posted @ 2014-05-05 19:25 heaventouch 阅读(299) 评论(0) 推荐(0)
poj 1990 MooFest (树状数组)
摘要：MooFestTime Limit:1000MSMemory Limit:30000KTotal Submissions:4888Accepted:2058DescriptionEvery year, Farmer John's N (1 11 #include12 #include13 #defi... 阅读全文
posted @ 2014-05-04 20:55 heaventouch 阅读(382) 评论(0) 推荐(0)
hdu 3015 Disharmony Trees (离散化+树状数组)
摘要：Disharmony TreesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 663Accepted Submission(s): 307Prob... 阅读全文
posted @ 2014-05-04 20:24 heaventouch 阅读(444) 评论(0) 推荐(0)
hdu 2838 Cow Sorting (树状数组)
摘要：Cow SortingTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2185Accepted Submission(s): 683Problem ... 阅读全文
posted @ 2014-04-26 10:02 heaventouch 阅读(277) 评论(0) 推荐(0)
hdu 1556 Color the ball (树状数组)
摘要：Color the ballTime Limit: 9000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7540Accepted Submission(s): 3887Prob... 阅读全文
posted @ 2014-04-20 11:15 heaventouch 阅读(385) 评论(0) 推荐(0)
hdu 3648 Median Filter (树状数组)
摘要：Median FilterTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1092Accepted Submission(s): 269Proble... 阅读全文
posted @ 2014-04-17 14:39 heaventouch 阅读(375) 评论(0) 推荐(0)
hdu 3584 Cube (三维树状数组)
摘要：CubeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 1307Accepted Submission(s): 674Problem 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 h 阅读全文
posted @ 2014-04-01 21:50 heaventouch 阅读(202) 评论(0) 推荐(0)
poj 2155 Matrix (树状数组)
摘要：MatrixTime Limit:3000MSMemory Limit:65536KTotal Submissions:16797Accepted:6312DescriptionGiven an N*N matrix A, whose elements are either 0 or 1. A[i, j] means the number in the i-th row and j-th column. Initially we have A[i, j] = 0 (1 14 #include15 #define N 100516 int c[N][N];17 int lowbit(int i) 阅读全文
posted @ 2014-04-01 21:12 heaventouch 阅读(185) 评论(0) 推荐(0)
poj 1195 Mobile phones (树状数组)
摘要：Mobile phonesTime Limit:5000MSMemory Limit:65536KTotal Submissions:13889Accepted:6451DescriptionSuppose 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 and columns numbered 阅读全文
posted @ 2014-04-01 12:46 heaventouch 阅读(280) 评论(0) 推荐(0)
poj 2299 Ultra-QuickSort (树状数组)
摘要：Ultra-QuickSortTime Limit:7000MSMemory Limit:65536KTotal Submissions:37971Accepted:13672DescriptionIn 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 sequence is sorted in 阅读全文
posted @ 2014-03-29 13:49 heaventouch 阅读(213) 评论(0) 推荐(0)
poj 2352 Stars (树状数组)
摘要：StarsTime Limit:1000MSMemory Limit:65536KTotal Submissions:29888Accepted:13066DescriptionAstronomers 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 not higher and not to the 阅读全文
posted @ 2014-03-29 10:59 heaventouch 阅读(181) 评论(0) 推荐(0)
hdu 1166 敌兵布阵 (线段树)
摘要：敌兵布阵Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 36121Accepted Submission(s): 15282Problem DescriptionC国的死对头A国这段时间正在进行军事演习，所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监测手段，所以每个工兵营地的人数C国都掌握的一清二楚,每个工兵营地的人 阅读全文
posted @ 2014-03-27 10:34 heaventouch 阅读(229) 评论(0) 推荐(0)