![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
线段树&&树状数组
文章平均质量分 79
sunshine668
这个作者很懒,什么都没留下…
展开
-
Circular RMQ
Description You are given circular array a0, a1, ..., an - 1. There are two types of operations with it: inc(lf, rg, v) — this operation increases each element on the segment [lf, rg] (inclusi原创 2014-07-05 20:54:45 · 494 阅读 · 0 评论 -
Count Color 线段树
Description Chosen Problem Solving and Program design as an optional course, you are required to solve all kinds of problems. Here, we get a new problem. There is a very long board with lengt原创 2014-07-08 10:41:46 · 344 阅读 · 0 评论 -
hdu 2305 WorstWeather Ever 二分 + 线段树(区间最值)
Problem Description "Man, this year has the worst weather ever!", David said as he sat crouched in the small cave where we had sought shelter from yet another sudden rainstorm. "Nuh-uh!", Diana im原创 2014-08-07 09:25:41 · 699 阅读 · 0 评论 -
poj 3928 Ping pong
Description N(3<=N<=20000) ping pong players live along a west-east street(consider the street as a line segment). Each player has a unique skill rank. To improve their skill rank, they often compe原创 2014-08-17 15:37:54 · 318 阅读 · 0 评论 -
poj 2155 Matrix
Description Given 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 We can change the matrix in the f原创 2014-08-17 16:36:10 · 278 阅读 · 0 评论