【codeforces 1136 E】 E. Nastya Hasn't Written a Legend 线段树

E

题意 给你一个序列 两个操作 第一个是给第i个数+x 然后执行一段连续操作 若后面的数比前面的数+k[i]小 则把这个数更新成前面这个数+k【i】  第二个操作就是区间查询和

做法 一开始首先对这个式子 a[i] + k[i] < a[i+1]

                                          ->a[i] < a[i+1] - k [i]

                                          ->a[i] - k[1]-......-k[i-1] < a[i+1] - k[i]  - k[1]-......-k[i-1]

设 t[i] = k[1] + k[2] + k[3] +... k[i-1]

                                          那么只要对a[i] - k[i-1]建树

后来你可以二分(一开始想二分 没看到题目一句话 It's guaranteed that initially ai+ki≤ai+1 for all 1≤i≤n−1

典型的二分提示 那么你就可以二分这个需要区间替换的最右边值了 实际上他们都是一个差分后的数组 因为减去 k[l-1]

所以区间和的时候 答案为query(1,1,n,x,y) + ks[r-1] - ks[l-2](l>=2) 然后 update 一段更新为sum就是单点加加上的那个值即可

注意col数组初始化不能为0 因为你一开始可能有负的 加上一个值可能变成0 要初始化一个重来没出现过的值

#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))

typedef pair<int,int> pll;
typedef long long ll;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;
const ll inf = 1e17;
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);}
const int MAX_N = 200025;
long long s[MAX_N<<2],k[MAX_N],ks[MAX_N],arr[MAX_N],col[MAX_N<<2];
void up(int rt)
{
    s[rt] = s[rt<<1] + s[rt<<1|1];
}
void build(int rt,int l,int r)
{
    col[rt] = inf;
    if(l==r)
    {
        s[rt] = arr[l] - k [l-1];
        return ;
    }
    int mid = (l+r)>>1;
    build(rt<<1,l,mid);
    build(rt<<1|1,mid+1,r);
    up(rt);
}
void down(int rt,int l,int r)
{
    if(col[rt]!=inf)
    {
        int mid = (l+r)>>1;
        col[rt<<1] = col[rt];
        col[rt<<1|1] = col[rt];
        s[rt<<1] = col[rt]*(mid-l+1);
        s[rt<<1|1] = col[rt]*(r-mid) ;
        col[rt] = inf;
    }
}
void update(int rt,int l,int r,int x,int y,long long v)
{
    if(x<=l&&r<=y)
    {
        col[rt] = v;
        s[rt] = col[rt]*(r-l+1);
        return ;
    }
    int mid = (l+r)>>1;
    down(rt,l,r);
    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);
}
long long query(int rt,int l,int r,int x,int y)
{
    if(x<=l&&r<=y)
    {
        return s[rt];
    }
    int mid = (l+r)>>1;
    long long res = 0;
    down(rt,l,r);
    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,m,x,y;
    char str[5];
    scanf("%d",&n);
    for(int i = 1;i<=n;++i) scanf("%lld",&arr[i]);
    for(int i = 1;i<n;++i)  scanf("%lld",&k[i]);
    for(int i = 2;i<n;++i) k[i]+=k[i-1];
    for(int i = 1;i<n;++i) ks[i] = ks[i-1] + k[i];
    build(1,1,n);
    scanf("%d",&m);
    while(m--)
    {
        scanf("%s%d%d",str,&x,&y);
        if(str[0]=='s')
        {
            printf("%lld\n",query(1,1,n,x,y)+ks[y-1]-(x>=2?ks[x-2]:0));
        }
        else
        {
            int l = 1,r = n,mid,ans_ = 1;
            long long sum = query(1,1,n,x,x) + y;
            while(l<=r)
            {
                mid = (l+r)>>1;
                if(sum>query(1,1,n,mid,mid))
                {
                    ans_ = mid;
                    l = mid + 1;
                }
                else r = mid - 1;
            }
            update(1,1,n,x,ans_,sum);
        }
    }
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}