![](https://img-blog.csdnimg.cn/20201014180756738.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数据结构--线段树
AliceBuJu
这个作者很懒,什么都没留下…
展开
-
【codevs 1080】线段树练习
单点修改,区间查询。#include<cstdio> #include<iostream> #include<cstring> #include<algorithm> #define lson num<<1,l,mid #define rson num<<1|1,mid+1,r using namespace std; int n,m; int tree[400000+5],a[100000+5];原创 2017-09-28 16:55:25 · 234 阅读 · 0 评论 -
【codevs 1082】线段树练习 3
区间修改,区间查询。(把练习2的int改为long long即可)#include<cstdio> #include<iostream> #include<cstring> #include<algorithm> #define lson num<<1,l,mid #define rson num<<1|1,mid+1,r #define ll long long using namespace s原创 2017-09-28 20:56:27 · 210 阅读 · 0 评论 -
【codevs 1081】线段树练习 2
区间修改,单点查询。#include<cstdio> #include<iostream> #include<cstring> #include<algorithm> #define lson num<<1,l,mid #define rson num<<1|1,mid+1,r using namespace std; int n,m; const int maxn=200000+5; int tr原创 2017-09-28 20:28:44 · 457 阅读 · 0 评论 -
【POJ 3264】Balanced Lineup
线段树。区间最值查询。#include<cstdio> #include<iostream> #include<cstring> #include<algorithm> #define lson num<<1,l,mid #define rson num<<1|1,mid+1,r using namespace std; long long n,m; long long tree[810000+5]原创 2017-09-29 09:53:22 · 189 阅读 · 0 评论 -
【NOIP】借教室(线段树)
洛谷95分 codevs AC的代码:#include<cstdio> #include<iostream> #include<algorithm> #include<cstring> #define lson num<<1,l,mid #define rson num<<1|1,mid+1,r using namespace std; int n,m; int j; bool flag=1; co原创 2017-09-30 22:15:39 · 605 阅读 · 1 评论 -
【模板】线段树区间修改、区间求和、查询最值
#include<cstdio> #include<iostream> #include<cstring> #include<algorithm> #include<cmath> #define ll long long #define lson num<<1,l,mid #define rson num<<1|1,mid+1,r using namespace std; const ll maxn原创 2017-11-01 07:54:02 · 328 阅读 · 0 评论