![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
线段树
Katrina~
哇你好鸭
展开
-
线段树单点修改求区间最值
#include<bits/stdc++.h>using namespace std;typedef long long ll;#define debug cout<<"hbgf"<<endl;const int mod=1e4+7;const int maxx=2e5+10;stack<char>ss;ll q[maxx*4],w[maxx*4];ll a[maxx*4];void push(int root){ q[root] = mi原创 2020-11-10 02:27:19 · 118 阅读 · 0 评论 -
线段树
嘿嘿嘿嘿原链接:请点击偷学长的代码,忘的时候方便看,????????单点修改#include <iostream>#include <algorithm>#include <cstring>#include <cstdio>#define mem(a, b) memset(a, b, sizeof(a))using namespace std;...原创 2020-04-07 19:01:03 · 144 阅读 · 0 评论