树状数组
文章平均质量分 87
非常可乐(이녕)
贵在自知,贵在坚持
展开
-
HDU 1556 Color the ball【线段树及lazy思想】【树状数组】
Color the ballTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13408 Accepted Submission(s): 6733Problem DescriptionN个气球排成一排,从左到原创 2015-10-09 20:23:06 · 436 阅读 · 0 评论 -
POJ 1990 MooFest 【树状数组】
MooFestTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 6056 Accepted: 2669DescriptionEvery year, Farmer John's N (1 <= N <= 20,000) cows attend "MooFest",原创 2015-11-28 17:13:34 · 410 阅读 · 0 评论 -
POJ 3321 Apple Tree 【树状数组 dfs记录时间戳】
Apple TreeTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 22366 Accepted: 6798DescriptionThere is an apple tree outside of kaka's house. Every autumn, a原创 2015-11-27 18:16:55 · 560 阅读 · 0 评论 -
POJ 2481 Cows 【树状数组】
CowsTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 15245 Accepted: 5078DescriptionFarmer John's cows have discovered that the clover growing along the ri原创 2015-11-27 16:22:29 · 438 阅读 · 0 评论 -
POJ 2299 Ultra-QuickSort 【树状数组求逆序数】
Ultra-QuickSortTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 50484 Accepted: 18517DescriptionIn this problem, you have to analyze a particular sorting a原创 2015-11-24 18:01:13 · 364 阅读 · 0 评论 -
POJ 1195 Mobile phones 【二维树状数组】
Mobile phonesTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 17005 Accepted: 7841DescriptionSuppose that the fourth generation mobile phone base stations原创 2015-11-24 22:06:55 · 322 阅读 · 0 评论 -
POJ 2352 Stars 【树状数组】
StarsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 38952 Accepted: 16944DescriptionAstronomers often examine star maps where stars are represented by po原创 2015-11-24 17:11:47 · 444 阅读 · 0 评论 -
POJ 3067 Japan 【树状数组 向下更新 向上求和】
JapanTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 23984 Accepted: 6492DescriptionJapan plans to welcome the ACM ICPC World Finals and a lot of roads mu原创 2015-11-24 20:44:46 · 339 阅读 · 0 评论 -
POJ 2155 Matrix 【树状数组 更新区间 求点】
MatrixTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 22105 Accepted: 8243DescriptionGiven an N*N matrix A, whose elements are either 0 or 1. A[i, j] mean原创 2015-11-24 15:26:42 · 351 阅读 · 0 评论 -
POJ 2309 BST 【lowbit()过】
BSTTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9189 Accepted: 5620DescriptionConsider an infinite full binary search tree (see the figure below),原创 2015-11-29 12:30:48 · 283 阅读 · 0 评论