洛谷试炼场 提高模板-nlogn数据结构

树状数组-区间求和

P3374 【模板】树状数组 1

 /*by SilverN*/
 #include<algorithm>
 #include<iostream>
 #include<cstring>
 #include<cstdio>
 #include<cmath>
 using namespace std;
 int read(){
     int x=,f=;char ch=getchar();
     while(ch<'' || ch>''){if(ch=='-')f=-;ch=getchar();}
     while(ch>='' && ch<=''){x=x*+ch-'';ch=getchar();}
     return x*f;
 }
 const int mxn=;
 int n,m;
 int t[mxn];
 void add(int x,int v){
     while(x<mxn){t[x]+=v;x+=x&-x;}
 }
 int smm(int x){
     int res=;
     while(x){
         res+=t[x];
         x-=x&-x;
     }
     return res;
 }
 int main(){
     int op,x,k;
     n=read();m=read();
     int i,j;
     for(i=;i<=n;i++){
         x=read();
         add(i,x);
     }
     for(i=;i<=m;i++){
         op=read();x=read();k=read();
         if(op==){
             add(x,k);
         }
         else{
             printf("%d\n",smm(k)-smm(x-));
         }
     }
     return ;
 }

树状数组1

树状数组-差分

P3368 【模板】树状数组 2

 /*by SilverN*/
 #include<algorithm>
 #include<iostream>
 #include<cstring>
 #include<cstdio>
 #include<cmath>
 using namespace std;
 int read(){
     int x=,f=;char ch=getchar();
     while(ch<'' || ch>''){if(ch=='-')f=-;ch=getchar();}
     while(ch>='' && ch<=''){x=x*+ch-'';ch=getchar();}
     return x*f;
 }
 const int mxn=;
 int n,m;
 int t[mxn];
 void add(int x,int v){
     while(x<mxn){t[x]+=v;x+=x&-x;}
 }
 int smm(int x){
     int res=;
     while(x){
         res+=t[x];
         x-=x&-x;
     }
     return res;
 }
 int main(){
     int op,x,k;
     n=read();m=read();
     int i,j;
     for(i=;i<=n;i++){
         x=read();
         add(i,x);
         add(i+,-x);
     }
     for(i=;i<=m;i++){
         op=read();
         if(op==){
             x=read();k=read();op=read();
             add(x,op);
             add(k+,-op);
         }
         else{
             x=read();
             printf("%d\n",smm(x));
         }
     }
     return ;
 }

树状数组2

线段树-区间加 区间乘

P3373 【模板】线段树 2

 /*by SilverN*/
 #include<iostream>
 #include<algorithm>
 #include<cstring>
 #include<cstdio>
 #include<cmath>
 #define ls l,mid,rt<<1
 #define rs mid+1,r,rt<<1|1
 #define lc rt<<1
 #define rc rt<<1|1
 using namespace std;
 const int mxn=;
 long long n,p;
 long long a[mxn];
 struct node{
     long long sum;
     long long mu;
     long long add;
 }tr[mxn];
 void pushdown(int rt,int m){
     tr[lc].sum=(tr[lc].sum*tr[rt].mu+(m-(m>>))*tr[rt].add)%p;
                                 //m-(m>>1)得到区间范围的一半，也就是左子树的范围
     tr[rc].sum=(tr[rc].sum*tr[rt].mu+(m>>)*tr[rt].add)%p;
     tr[lc].mu=tr[lc].mu*tr[rt].mu%p;
     tr[rc].mu=tr[rc].mu*tr[rt].mu%p;
     tr[lc].add=(tr[lc].add*tr[rt].mu+tr[rt].add)%p;
     tr[rc].add=(tr[rc].add*tr[rt].mu+tr[rt].add)%p;
     tr[rt].mu=;tr[rt].add=;
     return;
 }
 void Build(int l,int r,int rt){
     tr[rt].mu=;tr[rt].add=;
     if(l==r){
         tr[rt].sum=a[l];
         return;
     }
     int mid=(l+r)>>;
     Build(ls);
     Build(rs);
     tr[rt].sum=(tr[rt<<].sum+tr[rt<<|].sum)%p;
     return;
 }
 void add(int L,int R,int l,int r,int rt,int v){
     if(L<=l && r<=R){
         tr[rt].sum=(tr[rt].sum+v*(r-l+))%p;//本身值累加区间新增值
         tr[rt].add=(tr[rt].add+v)%p;//标记累加
         return;
     }
     pushdown(rt,r-l+);//下传
     int mid=(l+r)>>;
     if(L<=mid)add(L,R,ls,v);
     if(R>mid)add(L,R,rs,v);
     tr[rt].sum=(tr[lc].sum+tr[rc].sum)%p;
     return;
 }
 void multi(int L,int R,int l,int r,int rt,int v){
     if(L<=l && r<=R){
         tr[rt].add=(tr[rt].add*v)%p;
         tr[rt].mu=(tr[rt].mu*v)%p;
         tr[rt].sum=(tr[rt].sum*v)%p;
         return;
     }
     pushdown(rt,r-l+);
     int mid=(l+r)>>;
     if(L<=mid)multi(L,R,ls,v);
     if(R>mid)multi(L,R,rs,v);
     tr[rt].sum=(tr[lc].sum+tr[rc].sum)%p;
     return;
 }
 long long query(int L,int R,int l,int r,int rt){//查询
     if(L<=l && r<=R)return tr[rt].sum%p;
     int mid=(l+r)>>;
     pushdown(rt,r-l+);
     long long res=;
     if(L<=mid)res=(res+query(L,R,ls))%p;
     if(R>mid)res=(res+query(L,R,rs))%p;
     tr[rt].sum=(tr[lc].sum+tr[rc].sum)%p;
     return res%p;
 }
 int main(){
     int M;
     scanf("%lld%lld%lld",&n,&M,&p);
     int i,j;
     for(i=;i<=n;i++)scanf("%lld",&a[i]);
     Build(,n,);
     int op,g,t,c;
     while(M--){
         scanf("%d%d%d",&op,&t,&g);
         if(op==){//乘
             scanf("%d",&c);
             multi(t,g,,n,,c);
         }
         if(op==){//加
             scanf("%d",&c);
             add(t,g,,n,,c);
         }
         if(op==){//询问
             long long ans=query(t,g,,n,);
             printf("%lld\n",ans%p);
         }
     }
     return ;
 }

线段树区间修改

二叉堆

P3378 【模板】堆

 /*by SilverN*/
 #include<algorithm>
 #include<iostream>
 #include<cstring>
 #include<cstdio>
 #include<cmath>
 using namespace std;
 const int mxn=;
 int read(){
     int x=,f=;char ch=getchar();
     while(ch<'' || ch>''){if(ch=='-')f=-;ch=getchar();}
     while(ch>='' && ch<=''){x=x*+ch-'';ch=getchar();}
     return x*f;
 }
 int tp[mxn];
 int cnt=;
 void add(int x){
     tp[++cnt]=x;
     int now=cnt;
     while(now>){
         int nxt=now/;
         if(tp[nxt]<=tp[now])return;
         swap(tp[nxt],tp[now]);
         now=nxt;
     }
     return;
 }
 int del_head(){
     int res=tp[];
     tp[]=tp[cnt--];
     int now=;
     while(now<=cnt/){
         int nxt=now<<;
         if(nxt<cnt && tp[nxt+]<tp[nxt])nxt++;
         if(tp[now]>tp[nxt]){
             swap(tp[now],tp[nxt]);
             now=nxt;
         }
         else return res;
     }
     return res;
 }
 int main(){
     int n;
     n=read();
     int op,x,y;
     int i,j;
     for(i=;i<=n;i++){
         op=read();
         switch(op){
             case :{x=read();add(x);break;}
             case :{printf("%d\n",tp[]);break;}
             case :{del_head();break;}
         }
     }
     return ;
 }

最小堆

此处是最小堆