线段树
K_y
这个作者很懒,什么都没留下…
展开
-
POJ Balanced Lineup 3264
Balanced Lineup Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 48372 Accepted: 22684 Case Time Limit: 2000MS Description For the daily milking, Far原创 2016-10-11 16:44:49 · 221 阅读 · 0 评论 -
POJ Mayor's posters 2528(线段树+离散化)
Mayor's posters Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 59647 Accepted: 17287 Description The citizens of Bytetown, AB, could not stand that the ca原创 2016-10-11 19:18:14 · 238 阅读 · 0 评论 -
POJ Buy Tickets 2828(线段树)
Buy Tickets Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 18841 Accepted: 9352 Description Railway tickets were difficult to buy around the Lunar New Y原创 2016-10-12 20:24:07 · 213 阅读 · 0 评论 -
POJ Who Gets the Most Candies? 2886(线段树)
Who Gets the Most Candies? Time Limit: 5000MS Memory Limit: 131072K Total Submissions: 13876 Accepted: 4385 Case Time Limit: 2000MS Description N children are原创 2016-11-06 09:42:41 · 367 阅读 · 0 评论 -
POJ 4047 Garden
题意:给出一串数字,和许多操作, 当p=0时,x的位置变成y 当p=1时,x,y交换 当p=2时,输出在区间x,y中最大的连续的长度为k的区间和 分析:把1-k当做第一个数 , 2--k+1当做第二个数 ..... 然后就是一个线段树的区间更新,求区间最大 #include #include #include #include using namespace std;原创 2016-09-29 20:41:54 · 234 阅读 · 0 评论 -
POJ Count Color 2777(线段树)
Count Color Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 43739 Accepted: 13237 Description Chosen Problem Solving and Program design as an optional co原创 2016-10-26 20:22:40 · 234 阅读 · 0 评论