Mininda

题目线段树模版//hdu1166 敌兵布阵#include<iostream>#include<string>#include<cstdio>#include<cstring>#define lson l,m,pos<<1#define rson m+1,r,pos<<1|1using namespac...

原题 线段树区间修改模版，不会的百度一下线段树懒惰标记！//hdu 1698 just a hook#include<iostream>#include<cstdio>#include<cstring>#define lson l,m,pos<<1#define rson m+1,r,pos<<1|1using ...

原题//codevs1690 开关灯#include<iostream>#include<cstdio>#include<cstring>#define lson l,m,pos<<1#define rson m+1,r,pos<<1|1using namespace std;int n,m;int sum[500...

原题//codevs1299 切水果#include<iostream>#include<cstdio>#include<cstring>#define lson l,m,pos<<1#define rson m+1,r,pos<<1|1using namespace std;int n,m;int sum[200...

原题//codevs1082 线段树练习3#include<iostream>#include<cstdio>#include<cstring>#define lson l,m,pos<<1#define rson m+1,r,pos<<1|1#define ll long longusing namespace st...

原题#include<iostream>#include<cstdio>#define lson l,m,pos<<1#define rson m+1,r,pos<<1|1using namespace std;int n,m;int sum[301000];void pushup(int pos){sum[pos]=min(...

原题题解：线段树区间乘法，lazy标记的更新对于我这种萌新来说是个难点qwq。先理清楚想好了再写。先乘后除，一步一步慢慢来。//bzoj1798 [Ahoi2009]维护序列#include<iostream>#include<cstdio>#include<cstring>#define lson l,m,pos<<1#define rs...

原题线段树代码强烈建议在洛谷提交！某luogu管理员@yjjr 丧心病狂加强数据竟使线段树代码大面积迷之re=。=//bzoj1012 最大数#include<iostream>#include<cstring>#include<cstdio>#define lson l,m,pos<<1#define rson m+1,r,pos<...

题意求有公共点的m个区间的最长区间的长度与最短区间长度的最小值。题解先将区间以长度为关键字从小到大进行排序，易得最小值应该是排序后尽可能相近的两个区间。用头尾两个指针控制，每次更新利用线段树进行区间覆盖来判断是否符合有公共点的条件。代码//bzoj4653[Noi2016]区间#include<iostream>#include<algorithm>#inc...