c++ 线段树
碳酸钙的01妖精
这个作者很懒,什么都没留下…
展开
-
HDU-1166 敌兵布阵(单点加减 区间和查询)
HDU-1166 敌兵布阵(线段树 单点修改) 敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Problem DescriptionC国的死对头A国这段时间正在进行军事演习,所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿...原创 2018-05-23 22:45:16 · 148 阅读 · 0 评论 -
HDU-1754 I Hate It( 单点赋值 查询区间最大值)
HDU-1754 I Hate It(线段树 单点修改 找最大值)Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Problem Description很多学校流行一种比较的习惯。老师们很喜欢询问,从某某到某某当中,分数最高的是多少。这让很多学生很反感。不管你喜不喜...原创 2018-05-24 09:53:39 · 275 阅读 · 0 评论 -
计蒜客 ACM-ICPC 2017 Asia Xi'an Sum of xor sum ()
网址:https://nanti.jisuanke.com/t/20755Song Zha Zha has an 11-indexed array A . Li Zha Zha has QQ queries . Each query has two integers LL, RR , asking Ran Zha Zha to do the following thing .First , fin...原创 2018-05-24 20:27:29 · 706 阅读 · 0 评论 -
POJ-3468-A Simple Problem with Integers(区间加减, 区间查询)
POJ-3468-A Simple Problem with Integers(线段树 区间修改 区间查询)A Simple Problem with Integers Time Limit: 5000MS Memory Limit: 131072K Case Time Limit: 2000MS DescriptionYou have N intege...原创 2018-05-24 17:53:18 · 620 阅读 · 0 评论 -
单点赋值 求区间和
#include <cstdio>#include <cstring>#include <cstdlib>#include <algorithm>using namespace std;#define MAXN 100005typedef struct segmentree{ int left; int ...原创 2018-09-16 02:19:28 · 132 阅读 · 0 评论 -
Ryuji doesn't want to study
Ryuji is not a good student, and he doesn't want to study. But there are n books he should learn, each book has its knowledge a[i]a[i].Unfortunately, the longer he learns, the fewer he gets.That m...原创 2018-09-16 02:25:04 · 179 阅读 · 0 评论