线段树
文章平均质量分 79
Nowara_Shinnosuke
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
Gorgeous Sequence
There is a sequence aa of length nn. We use aiai to denote the ii-th element in this sequence. You should do the following three types of operations to this sequence. 0 x y t0 x y t: For原创 2017-05-25 18:00:36 · 675 阅读 · 0 评论 -
加农炮
一个长度为M的正整数数组A,表示从左向右的地形高度。测试一种加农炮,炮弹平行于地面从左向右飞行,高度为H,如果某处地形的高度大于等于炮弹飞行的高度H(Ai" role="presentation" style="display: inline; line-height: normal; word-spacing: normal; word-wrap: normal; white-space: no原创 2017-05-21 15:28:21 · 598 阅读 · 0 评论 -
F - Level up HDU - 3954
Level up is the task of all online games. It's very boooooooooring. There is only level up in those games, except level up. In a online game, there are N heroes numbered id from 1 to N, each begins原创 2017-07-12 22:58:21 · 448 阅读 · 0 评论 -
hdu6070 Dirt Ratio
二分答案mid,检验是否存在一个区间满足size(l,r)/(r-l+1) ≤mid,也就是size(l,r)+mid*l≤mid*(r+1)。#include#include#include#define lson l,mid,rt<<1#define rson mid+1,r,rt<<1|1using namespace std;const int maxn=6e4+10;原创 2017-08-04 16:56:04 · 305 阅读 · 0 评论
分享