【COGS 2964】 数列操作η 线段树

题目描述：

题意 给你n长度的b 数组 b数组是 [1,n]的全排列 然后a数组初始化为0 Q个操作
add l r
query l r
add操作是把a数组区间加1
$$query操作是查询l-r的\lfloor \frac{a\left[i\right]}{b\left[i\right]}\rfloor$$
样例数据：

输入
5 12
1 5 2 4 3
add 1 4
query 1 4
add 2 5
query 2 5
add 3 5
query 1 5
add 2 4
query 1 4
add 2 5
query 2 5
add 2 2
query 1 5

输出
1
1
2
4
4
6
做法
一开始想的是其实你暴力改点复杂度是 n+n/2+n/3+…1 = lnn (调和级数
只不过要维护很多东西
其实你反过来想 你为什么要改点 就是当前a[i]+1是b[i]的倍数了
那么是不是意味着 a[i]%b[i] 为 1 了？
所以我们只要维护b[i] - a[i]%b[i] 意思是差多少能让b[i] 进一个1
我们这样建立一颗线段树 然后让num数组与1进行跳 如果到单点则树状数组更新 然后让num[rt] = b[l]
因为你要重新开始这个过程了
如果num[rt] > 1 那么你直接区间减 1 即可
代码还是比较优美的

/*
    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);
int Min(int a,int b){if(a<b) return a;return b;}
const int MAX_N = 100025;
int num[MAX_N<<2],C[MAX_N<<1],col[MAX_N<<2],b[MAX_N];
void add(int x,int v)
{
    for(;x<MAX_N;x+=x&(-x))
        C[x]+=v;
}
int getsum(int x)
{
    int res = 0;
    for(;x;x-=x&(-x))
        res+=C[x];
    return res;
}
void up(int rt)
{
    num[rt] = Min(num[rt<<1],num[rt<<1|1]);
}
void down(int rt,int l,int r)
{
    if(col[rt])
    {
        col[rt<<1] += col[rt];
        col[rt<<1|1] += col[rt];
        num[rt<<1] += col[rt];
        num[rt<<1|1] += col[rt];
        col[rt] = 0;
    }
}
void build(int rt,int l,int r)
{
    num[rt] = col[rt] = 0;
    if(l==r)
    {
        num[rt] = b[l];
        return ;
    }
    build(rt<<1,l,mid);
    build(rt<<1|1,mid+1,r);
    return ;
}
void update(int rt,int l,int r,int x,int y)
{
    if(l==r&&num[rt]==1) {num[rt]=b[l];add(l,1);return;}
    if(x<=l&&r<=y&&num[rt]>1) {col[rt]+=-1;num[rt]-=1;return;}
    down(rt,l,r);
    if(x<=mid) update(rt<<1,l,mid,x,y);
    if(mid<y) update(rt<<1|1,mid+1,r,x,y);
    up(rt);
}
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int n,Q,x,y;
    char str[10];
    scanf("%d%d",&n,&Q);
    for(int i = 1;i<=n;++i) scanf("%d",&b[i]);
    build(1,1,n);
    while(Q--)
    {
        scanf("%s%d%d",str,&x,&y);
        if(str[0]=='a')
        {
            update(1,1,n,x,y);
        }
        else
        {
            printf("%d\n",getsum(y)-getsum(x-1));
        }
    }
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}