C43 线段树+暴力区修 P4145 上帝造题的七分钟 2

视频链接：229 线段树+暴力区修 P4145 上帝造题的七分钟 2_哔哩哔哩_bilibili

 

Luogu P4145 上帝造题的七分钟 2

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;

const int N=100005;
#define LL long long
#define ls u<<1
#define rs u<<1|1
#define mid ((l+r)>>1)
LL a[N];
LL sum[N<<2],mx[N<<2];
//sum:区间和，mx:区间最大

void pushup(int u){ //上传
  sum[u]=sum[ls]+sum[rs];
  mx[u]=max(mx[ls],mx[rs]);
}
void build(int u,int l,int r){ //建树
  sum[u]=mx[u]=a[l];
  if(l==r) return;
  build(ls,l,mid);
  build(rs,mid+1,r);
  pushup(u);
}
void change(int u,int l,int r,int x,int y){ //区修
  if(mx[u]==1) return; //优化
  if(l==r){
    sum[u]=sqrt(sum[u]);
    mx[u]=sqrt(mx[u]);
    return;
  }
  if(x<=mid) change(ls,l,mid,x,y);
  if(y>mid) change(rs,mid+1,r,x,y);
  pushup(u);
}
LL query(int u,int l,int r,int x,int y){ //区查
  if(x<=l && r<=y) return sum[u];
  LL s=0;
  if(x<=mid) s+=query(ls,l,mid,x,y);
  if(y>mid) s+=query(rs,mid+1,r,x,y);
  return s;
}
int main(){
  int n,m,opt,l,r; scanf("%d",&n);
  for(int i=1; i<=n; ++i)scanf("%lld",&a[i]);
  build(1,1,n);
  scanf("%d",&m);
  while(m--){
    scanf("%d%d%d",&opt,&l,&r);
    if(l>r) swap(l,r);
    if(opt==0) change(1,1,n,l,r);
    else printf("%lld\n",query(1,1,n,l,r));
  }
  return 0;
}

 

练习：

Luogu SP2713 GSS4 - Can you answer these queries IV

Luogu CF438D The Child and Sequence

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;

const int N=100005;
#define LL long long
#define ls u<< 1
#define rs u<< 1|1
#define mid ((l+r)>>1)
int n,m,a[N];
LL sum[N<<2],mx[N<<2];
//sum:区间和，mx:区间最大

void pushup(int u){ //上传
  sum[u]=sum[ls]+sum[rs];
  mx[u]=max(mx[ls],mx[rs]);
}
void build(int u,int l,int r){  //建树
  sum[u]=mx[u]=a[l];
  if(l==r) return;
  build(ls,l,mid);
  build(rs,mid+1,r);
  pushup(u);
}
void change2(int u,int l,int r,int x,int y,int p){ //区修
  if(mx[u]<p) return; //优化
  if(l==r){
    sum[u]%=p; mx[u]%=p; return;
  }
  if(x<=mid) change2(ls,l,mid,x,y,p);
  if(y>mid) change2(rs,mid+1,r,x,y,p);
  pushup(u);
}
void change3(int u,int l,int r,int x,int v){ //点修
  if(l==r){
    sum[u]=mx[u]=v; return;
  }
  if(x<=mid) change3(ls,l,mid,x,v);
  else change3(rs,mid+1,r,x,v);
  pushup(u);
}
LL query(int u,int l,int r,int x,int y){  //区查
  if(x<=l && r<=y) return sum[u];
  LL s=0;
  if(x<=mid) s+=query(ls,l,mid,x,y);
  if(y>mid) s+=query(rs,mid+1,r,x,y);
  return s;
}
int main(){
  scanf("%d %d",&n,&m);
  for(int i=1;i<=n;i++) scanf("%d",&a[i]);
  build(1,1,n);
  while(m--){
    int opt,x,y,z;
    scanf("%d%d%d",&opt,&x,&y);
    if(opt==1) printf("%lld\n",query(1,1,n,x,y));
    else if(opt==2){
      scanf("%d",&z);
      change2(1,1,n,x,y,z);
    }
    else change3(1,1,n,x,y);
  }
  return 0;
}

CF920F SUM and REPLACE

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;

const int N=300005;
#define LL long long
#define ls u<< 1
#define rs u<< 1|1
#define mid ((l+r)>>1)
int n,m,a[N],d[1000001];
LL sum[N<<2],mx[N<<2];
//sum:区间和，mx:区间最大

void pushup(int u){ //上传
  sum[u]=sum[ls]+sum[rs];
  mx[u]=max(mx[ls],mx[rs]);
}
void build(int u,int l,int r){ //建树
  sum[u]=mx[u]=a[l];
  if(l==r) return;
  build(ls,l,mid);
  build(rs,mid+1,r);
  pushup(u);
}
void change(int u,int l,int r,int x,int y){ //区修
  if(mx[u]<=2) return; //优化
  if(l==r){
    sum[u]=mx[u]=d[sum[u]]; return;
  }
  if(x<=mid) change(ls,l,mid,x,y);
  if(y>mid) change(rs,mid+1,r,x,y);
  pushup(u);
}
LL query(int u,int l,int r,int x,int y){  //区查
  if(x<=l && r<=y) return sum[u];
  LL s=0;
  if(x<=mid) s+=query(ls,l,mid,x,y);
  if(y>mid) s+=query(rs,mid+1,r,x,y);
  return s;
}
int main(){
  for(int i=1;i<=1000000;i++)
    for(int j=i;j<=1000000;j+=i)
      d[j]++; //预处理约数个数
  scanf("%d %d",&n,&m);
  for(int i=1;i<=n;i++) scanf("%d",&a[i]);
  build(1,1,n);
  while(m--){
    int opt,x,y; scanf("%d%d%d",&opt,&x,&y);
    if(opt==1) change(1,1,n,x,y);
    else printf("%lld\n",query(1,1,n,x,y));
  }
  return 0;
}