文章目录
归纳整理 :
单点修改,单点查询:数组
单点修改,区间查询:树状数组、线段树
区间修改,单点查询:树状数组差分,单点查询转化为求前缀和(区间查询)、线段树不好做
区间修改,区间查询:线段树lazy、树状数组b,c数组配合使用
二维区域的单点修改、区间查询:二维树状数组
二位区域的区间修改、单点查询:二维差分树状数组求一次前缀和
二维区域的区间修改、区间查询:二维差分树状数组,bc数组配合使用
模板题:
区间操作,单点查询
差分线段树、树状数组
选用差分树状数组,因为好写(
#include<iostream>
using namespace std;
const int N = 500005;
int n,m,op,u,v,k;
long long c[N]={0};
int lowbit(int x){
return x&(-x);
}
void update(int x,int y){//x处 +y
for(;x<=n;x += lowbit(x)){
c[x] += y;
}
}
void query(int x){
long long ans = 0;
for(;x;x -= lowbit(x)){
ans += c[x];
}
printf("%lld\n",ans);
}
int main(){
scanf("%d%d",&n,&m);
int last = 0;
for(int i=1;i<=n;i++){
scanf("%d",&u);
update(i,u-last);
last = u;
}
for(int i=1;i<=m;i++){
scanf("%d",&op);
if(op==1){
scanf("%d%d%d",&u,&v,&k);
update(u,k);
update(v+1,-k);
}
if(op==2){
scanf("%d",&u);
query(u);
}
}
return 0;
}
二维的单点修改、区间查询
#include<iostream>
using namespace std;
const int N = 5005;
long long a[N][N] = {0};
int n,m,op,x,y,z,w,d;
long long ans;
int lowbit(int x){
return x&(-x);
}
void update(int x,int y,int d){
for(int i=x;i<=n;i += lowbit(i))
for(int j=y;j<=m;j += lowbit(j)){
a[i][j] += d;
}
}
//等一下啊……好像是可以的啊……
long long query(int x,int y){
long long tmp = 0;
for(int i=x;i>0;i -= lowbit(i))
for(int j=y;j>0;j -= lowbit(j)){
tmp += a[i][j];
}
return tmp;
}
int main(){
scanf("%d%d",&n,&m);
while(scanf("%d",&op)!=EOF){
scanf("%d%d",&x,&y);
if(op==1){
scanf("%d",&d);
update(x,y,d);
}
else {
ans = 0;
scanf("%d%d",&z,&w);
ans = query(z,w)-query(z,y-1)-query(x-1,w)+query(x-1,y-1);
printf("%lld\n",ans);
}
}
return 0;
}
区间修改,区间查询
//标准差D(x)=E(x^2)-[E(x)]^2 方差S^2 = n*D(x)
#include<iostream>
using namespace std;
const int N = 100005;
int n,m;
double a[N] = {0},sum[N*4] = {0},sqr[N*4] = {0},lazy[N*4] = {0},k;
int op,x,y;
void pushup(int rt){
sum[rt] = sum[rt<<1]+sum[rt<<1|1];
sqr[rt] = sqr[rt<<1]+sqr[rt<<1|1];
}
void build(int rt,int l,int r){
if(l==r){
sum[rt] = a[l];
sqr[rt] = a[l]*a[l];
return ;
}
int mid = (l+r)>>1;
build(rt<<1,l,mid);
build(rt<<1|1,mid+1,r);
pushup(rt);
}
void pushdown(int rt,int l,int r){
int mid = (l+r)>>1;
sqr[rt<<1] += 2*lazy[rt]*sum[rt<<1]+(mid-l+1)*lazy[rt]*lazy[rt];
sum[rt<<1] += (mid-l+1)*lazy[rt];
lazy[rt<<1] += lazy[rt];
sqr[rt<<1|1] += 2*lazy[rt]*sum[rt<<1|1]+(r-mid)*lazy[rt]*lazy[rt];
sum[rt<<1|1] += (r-mid)*lazy[rt];
lazy[rt<<1|1] += lazy[rt];
lazy[rt] = 0;
}
void update(int rt,int l,int r,int x,int y,double k){
if(r<x || l>y) return ;
if(x<=l && r<=y){
sqr[rt] += 2*k*sum[rt]+(r-l+1)*k*k;
sum[rt] += (r-l+1)*k;
lazy[rt] += k;
return ;
}
if(lazy[rt]) pushdown(rt,l,r);
int mid = (l+r)>>1;
update(rt<<1,l,mid,x,y,k);
update(rt<<1|1,mid+1,r,x,y,k);
pushup(rt);
}
double query_sum(int rt,int l,int r,int x,int y){
if(r<x || l>y) return 0;
if(x<=l && r<=y) return sum[rt];
if(lazy[rt]) pushdown(rt,l,r);
int mid = (l+r)>>1;
return query_sum(rt<<1,l,mid,x,y)+query_sum(rt<<1|1,mid+1,r,x,y);
}
double query_sqr(int rt,int l,int r,int x,int y){
if(r<x || l>y) return 0;
if(x<=l && r<=y) return sqr[rt];
if(lazy[rt]) pushdown(rt,l,r);
int mid = (l+r)>>1;
return query_sqr(rt<<1,l,mid,x,y)+query_sqr(rt<<1|1,mid+1,r,x,y);
}
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++){
scanf("%lf",&a[i]);
}
build(1,1,n);
for(int i=1;i<=m;i++){
scanf("%d",&op);
if(op==1){
scanf("%d%d%lf",&x,&y,&k);
update(1,1,n,x,y,k);
}
if(op==2){
scanf("%d%d",&x,&y);
double bar = query_sum(1,1,n,x,y);
bar /= (y-x+1);
printf("%d\n",(int)(bar*100));
}
if(op==3){
scanf("%d%d",&x,&y);
double summ = query_sum(1,1,n,x,y);
summ /= (y-x+1);
double square = query_sqr(1,1,n,x,y);
square /= (y-x+1);
double variance = square-summ*summ;
printf("%d\n",(int)(variance*100));
}
}
return 0;
}
练习题:
Luogu P2894 [USACO08FEB]Hotel G
差点没整死我、、、
代码:
一、倔强地没用lazytag
#include<iostream>
using namespace std;
const int N = 50005;
int n,m,op,d,e;
int maxlen[N*4] = {0},llen[N*4] = {0},rlen[N*4] = {0};
void pushdown1(int rt,int l,int r){
maxlen[rt] = r-l+1;
llen[rt] = r-l+1;
rlen[rt] = r-l+1;
if(l==r) return ;
int mid = (l+r)>>1;
pushdown1(rt<<1,l,mid);
pushdown1(rt<<1|1,mid+1,r);
}
void pushdown0(int rt,int l,int r){
maxlen[rt] = 0;
llen[rt] = 0;
rlen[rt] = 0;
if(l==r) return ;
int mid = (l+r)>>1;
pushdown0(rt<<1,l,mid);
pushdown0(rt<<1|1,mid+1,r);
}
void pushup(int rt,int l,int r){
int mid = (l+r)>>1;
maxlen[rt] = maxlen[rt<<1];
if(maxlen[rt<<1|1] > maxlen[rt]) maxlen[rt] = maxlen[rt<<1|1];
if(rlen[rt<<1]+llen[rt<<1|1] > maxlen[rt]) maxlen[rt] = rlen[rt<<1]+llen[rt<<1|1];
llen[rt] = llen[rt<<1];//从头再来了,因为可能是fill了以后的
rlen[rt] = rlen[rt<<1|1];
if(llen[rt<<1] == mid-l+1) llen[rt] += llen[rt<<1|1];
if(rlen[rt<<1|1] == r-mid) rlen[rt] += rlen[rt<<1];
}
int find(int k,int rt,int l,int r){
if(l==r) {
return l;
}
int mid = (l+r)>>1;
if(maxlen[rt<<1]>=k) return find(k,rt<<1,l,mid);
if(rlen[rt<<1]+llen[rt<<1|1]>=k) return mid-rlen[rt<<1]+1;
else return find(k,rt<<1|1,mid+1,r);//忘记写return可不行啊!!! 开了O2会RE
//可能是全在右边,而且右边的最左侧不为空!
}
void _fill(int x,int y,int rt,int l,int r){//要回溯的,所以必须从头开始x,y,1,1,n
if(y<l || x>r) return ;
if(x<=l && r<=y){
pushdown0(rt,l,r);
return ;
}
int mid = (l+r)>>1;
_fill(x,y,rt<<1,l,mid);
_fill(x,y,rt<<1|1,mid+1,r);
pushup(rt,l,r);
}
void clear(int x,int y,int rt,int l,int r){
if(y<l || x>r) return ;
if(x<=l && r<=y){
pushdown1(rt,l,r);
return ;
}
int mid = (l+r)>>1;
clear(x,y,rt<<1,l,mid);
clear(x,y,rt<<1|1,mid+1,r);
pushup(rt,l,r);
}
int main(){
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
scanf("%d%d",&n,&m);
pushdown1(1,1,n);
for(int i=1;i<=m;i++){
scanf("%d",&op);
if(op==1){
scanf("%d",&d);
int ans = 0;
if(maxlen[1]>=d)
ans = find(d,1,1,n);
printf("%d\n",ans);
if(ans) _fill(ans,ans+d-1,1,1,n);
}
if(op==2){
scanf("%d%d",&e,&d);
clear(e,e+d-1,1,1,n);
}
}
return 0;
}
然后过了luogu,T了OJ
二、加了lazy
#include<iostream>
using namespace std;
const int N = 50005;
int n,m,op,d,e;
int maxlen[N*4] = {0},llen[N*4] = {0},rlen[N*4] = {0},lazy[N*4];
void build(int rt,int l,int r){
maxlen[rt] = r-l+1;
llen[rt] = r-l+1;
rlen[rt] = r-l+1;
lazy[rt] = -1;
if(l==r) return ;
int mid = (l+r)>>1;
build(rt<<1,l,mid);
build(rt<<1|1,mid+1,r);
}
void pushdown(int rt,int l,int r){//lazy:1表示住满无空,0表示全空
if(l==r) return ;
if(lazy[rt]==-1) return ;
int mid = (l+r)>>1;
if(lazy[rt]==1){//fill
maxlen[rt<<1] = maxlen[rt<<1|1] = 0;
llen[rt<<1] = llen[rt<<1|1] = 0;
rlen[rt<<1] = rlen[rt<<1|1] = 0;
lazy[rt<<1] = lazy[rt<<1|1] = 1;
}
if(lazy[rt]==0){
maxlen[rt<<1] = llen[rt<<1] = rlen[rt<<1] = mid-l+1;
maxlen[rt<<1|1] = llen[rt<<1|1] = rlen[rt<<1|1] = r-mid;
lazy[rt<<1] = lazy[rt<<1|1] = 0;
}
lazy[rt] = -1;
}
void pushup(int rt,int l,int r){
int mid = (l+r)>>1;
maxlen[rt] = maxlen[rt<<1];
if(maxlen[rt<<1|1] > maxlen[rt]) maxlen[rt] = maxlen[rt<<1|1];
if(rlen[rt<<1]+llen[rt<<1|1] > maxlen[rt]) maxlen[rt] = rlen[rt<<1]+llen[rt<<1|1];
llen[rt] = llen[rt<<1];//从头再来了,因为可能是fill了以后的
rlen[rt] = rlen[rt<<1|1];
if(llen[rt<<1] == mid-l+1) llen[rt] += llen[rt<<1|1];
if(rlen[rt<<1|1] == r-mid) rlen[rt] += rlen[rt<<1];
}
int find(int k,int rt,int l,int r){//找空房间
pushdown(rt,l,r);
if(l==r) {
return l;
}
int mid = (l+r)>>1;
if(maxlen[rt<<1]>=k) return find(k,rt<<1,l,mid);
if(rlen[rt<<1]+llen[rt<<1|1]>=k) return mid-rlen[rt<<1]+1;
//上面这句逻辑被我自己写烂了 左儿子右边有值,但是右儿子不一定连的上去
else return find(k,rt<<1|1,mid+1,r);//忘记写return可不行啊!!! 开了O2会RE
//可能是全在右边,而且右边的最左侧不为空!
}
void _fill(int x,int y,int rt,int l,int r){//填充! 住满 lazy1
pushdown(rt,l,r);
if(y<l || x>r) return ;
if(x<=l && r<=y){
maxlen[rt] = rlen[rt] = llen[rt] = 0;
lazy[rt] = 1;
return ;
}
int mid = (l+r)>>1;
_fill(x,y,rt<<1,l,mid);
_fill(x,y,rt<<1|1,mid+1,r);
pushup(rt,l,r);
}
void clear(int x,int y,int rt,int l,int r){//全空lazy0
pushdown(rt,l,r);
if(y<l || x>r) return ;
if(x<=l && r<=y){
maxlen[rt] = llen[rt] = rlen[rt] = r-l+1;
lazy[rt] = 0;
return ;
}
int mid = (l+r)>>1;
clear(x,y,rt<<1,l,mid);
clear(x,y,rt<<1|1,mid+1,r);
pushup(rt,l,r);
}
int main(){
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
scanf("%d%d",&n,&m);
build(1,1,n);
for(int i=1;i<=m;i++){
scanf("%d",&op);
if(op==1){
scanf("%d",&d);
int ans = 0;
if(maxlen[1]>=d)
ans = find(d,1,1,n);
printf("%d\n",ans);
if(ans) _fill(ans,ans+d-1,1,1,n);
}
if(op==2){
scanf("%d%d",&e,&d);
clear(e,e+d-1,1,1,n);
}
}
return 0;
}
教训
- 到头来还是自己的逻辑写出了问题,你还能怪谁捏……参见
find
的中间一次if
,那里写错了,自认为只要左儿子靠右边有空位就行……其实不可以的 - 注意该返回不返回的话,在开了O2评测的状态下会RE
- 你的
lazy
不同值表示什么意思要记清楚,果不其然自己写的时候搞混了 - 还是要写
lazy
,因为不可能逃开pushdown
(这一点也得到了验证,因为自己之前还想侥幸逃过pushdown
,后来发现不可能因为会用到那些小区间,如果没有提前pushdown
会导致出错)而要减小时间复杂度必须用lazy
fill
的时候还是必须从x,y,1,1,n
开始搜,因为要回溯pushup
的- 还没被自己害死真是太好了
OJ1545 维度跃迁
二维树状数组的题,区别在于它要前缀和的区域很怪异
#include<iostream>
using namespace std;
const int N = 5005;
long long a[2*N][2*N] = {0};
int n,m,op,x,y,d;
long long ans;
inline int read() { // read in a int and return
char ch = getchar();
int x = 0, f = 1;
while(ch < '0' || ch > '9')
{
if(ch == '-') f = -1;
ch = getchar();
}
while('0' <= ch && ch <= '9')
{
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
int lowbit(int x){
return x&(-x);
}
void update(int x,int y,int d){
for(int i=x;i<=2*m;i += lowbit(i))
for(int j=y;j<=2*n;j += lowbit(j)){
a[i][j] += d;
}
}
long long query(int x,int y){
long long tmp = 0;
for(int i=x;i>0;i -= lowbit(i))
for(int j=y;j>0;j -= lowbit(j)){
tmp += a[i][j];
}
return tmp;
}
long long solve(int x,int y,int z,int w){
return query(z,w)-query(z,y-1)-query(x-1,w)+query(x-1,y-1);
}
int main(){
m = read();n = read();
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++){
x = read();
update(i+j,j+n-i,x);
}
while(cin>>op){
x = read();
y = read();
d = read();
if(op==1){
update(x+y,x+n-y,d);
}
else {
ans = 0;
ans = solve(x-d+y,x-d+n-y,x+d+y,x+d+n-y);
printf("%lld\n",ans);
}
}
return 0;
}
更加怪异的一个点是:它的数据输入很怪,m*n的区域,m对应x,n对应y,而输入数据的时候竟然是n行m列逐行输入……谁会这么干啊我说!!!!!记得再写代码的时候要注意xy分别对应哪个值,谁是n谁是m…………记清楚了再写的时候就会清晰很多。debug的时候也小心这个点被坑到。
关于算法:我的笔记如下