【Codeforces 438 D The Child and Sequence】区间取模 势能线段树

cf 438 D
题意 1 操作 区间求和
2 操作区间取模
3 操作 单点修改
这道题自己很玄学
用单点update 只要maxx[rt]<v (取模的数)return 就能过
根据定理每个数只要取模 大小至少减少一半 那么最多log2次
所以时间复杂度是 O(nloglogn)
但是自己写了一个区间 maxx[rt] == minn[rt] 进行区间覆盖的 就一直写错 不知道为啥
还是老老实实发一个单点update的吧

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define lc (rt<<1)
#define rc (rt<<11)
#define mid ((l+r)>>1)

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
const int MAX_N = 100025;
ll s[MAX_N<<2];
int maxx[MAX_N<<2],minn[MAX_N<<2];
int Max(int a,int b){if(a>b) return a;return b;}
int Min(int a,int b){if(a<b) return a;return b;}
void up(int rt)
{
    s[rt] = s[rt<<1] + s[rt<<1|1];
    maxx[rt] = Max(maxx[rt<<1],maxx[rt<<1|1]);
    minn[rt] = Min(minn[rt<<1],minn[rt<<1|1]);
}
void build(int rt,int l,int r)
{
    maxx[rt] = minn[rt] = s[rt] = 0;
    if(l==r)
    {
        scanf("%lld",&s[rt]);
        maxx[rt] = minn[rt] = s[rt];
        return ;
    }
    build(rt<<1,l,mid);
    build(rt<<1|1,mid+1,r);
    up(rt);
}
void change(int rt,int l,int r,int x,int v)
{
    if(l==r)
    {
        maxx[rt] = minn[rt] = s[rt] = v;
        return ;
    }
    if(x<=mid) change(rt<<1,l,mid,x,v);
    else change(rt<<1|1,mid+1,r,x,v);
    up(rt);
}
void update(int rt,int l,int r,int x,int y,int v)
{
    if(maxx[rt]<v) return;
    if(l==r)
    {
        int tmp = maxx[rt]%v;
        s[rt] = maxx[rt] = minn[rt] = tmp;
        return ;
    }
    if(x<=mid) update(rt<<1,l,mid,x,y,v);
    if(mid<y) update(rt<<1|1,mid+1,r,x,y,v);
    up(rt);
}
ll query(int rt,int l,int r,int x,int y)
{
    if(x<=l&&r<=y)
    {
        return s[rt];
    }
    ll res = 0;
    if(x<=mid) res+=query(rt<<1,l,mid,x,y);
    if(mid<y) res+=query(rt<<1|1,mid+1,r,x,y);
    return res;
}
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int n,Q,opt,x,y,v;
    scanf("%d%d",&n,&Q);
    build(1,1,n);
    while(Q--)
    {
        scanf("%d%d%d",&opt,&x,&y);
        if(opt==1)  printf("%lld\n",query(1,1,n,x,y));
        else if(opt==3) change(1,1,n,x,y);
        else
        {
            int v;
            scanf("%d",&v);
            update(1,1,n,x,y,v);
        }
    }
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}