线段树
关注
分享
扫一扫
K_y
这个作者很懒，什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
POJ Balanced Lineup 3264
Balanced LineupTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 48372 Accepted: 22684Case Time Limit: 2000MSDescriptionFor the daily milking, Far原创 2016-10-11 16:44:49 · 261 阅读 · 0 评论 -
POJ Mayor's posters 2528(线段树＋离散化)
Mayor's postersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 59647 Accepted: 17287DescriptionThe citizens of Bytetown, AB, could not stand that the ca原创 2016-10-11 19:18:14 · 278 阅读 · 0 评论 -
POJ Buy Tickets 2828(线段树)
Buy TicketsTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 18841 Accepted: 9352DescriptionRailway tickets were difficult to buy around the Lunar New Y原创 2016-10-12 20:24:07 · 253 阅读 · 0 评论 -
POJ Who Gets the Most Candies? 2886(线段树)
Who Gets the Most Candies?Time Limit: 5000MS Memory Limit: 131072KTotal Submissions: 13876 Accepted: 4385Case Time Limit: 2000MSDescriptionN children are原创 2016-11-06 09:42:41 · 453 阅读 · 0 评论 -
POJ 4047 Garden
题意：给出一串数字，和许多操作，当p＝０时，ｘ的位置变成ｙ当ｐ=1时，ｘ,ｙ交换当p=2时，输出在区间x,y中最大的连续的长度为k的区间和分析：把１－ｋ当做第一个数 ， 2－－k+1当做第二个数 ．．．．．然后就是一个线段树的区间更新，求区间最大#include #include #include #include using namespace std;原创 2016-09-29 20:41:54 · 272 阅读 · 0 评论 -
POJ Count Color 2777(线段树)
Count ColorTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 43739 Accepted: 13237DescriptionChosen Problem Solving and Program design as an optional co原创 2016-10-26 20:22:40 · 277 阅读 · 0 评论