【题解】线段树·关于时间

题目链接

这是本蒟蒻的原创题

确实很简单

本蒟蒻LOJ账号Diogenes

本题的难点在于每个操作会重复多次。核心思想是把第t秒的操作提前到第一秒，再减去多余的部分。有一种构造方法： $Add[i..j]$ 表示区间$【i，j】$需要加的值。
$Del[i..j]$表示区间$【i，j】$统计答案时需要减去的值。
假设时间$t$给区间$[L,R]$加上$x$，应当给$Add[L..R]$每个加上$x$，给Del[L..R]每个加上$x*（t-1）$
假设时间t求区间$[L,R]$的和，就计算$Add[L..R]*t-Del[L..R]$
用线段树维护区间加，区间和。

#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
#include<iostream>
#define ll long long
using namespace std;

inline int getint()
{
    char ch;
    int p=0,t;
    for(ch=getchar();ch!='-' && !isdigit(ch);ch=getchar());
    if(ch=='-'){
        t=-1;
    }
    else{
        t=1;
    }
    for(;!isdigit(ch);ch=getchar());
    for(;isdigit(ch);ch=getchar()){
        p=p*10+ch-48;
    }
    return t*p;
}

inline long long getLL()
{
    char ch;
    long long p=0,t;
    for(ch=getchar();ch!='-' && !isdigit(ch);ch=getchar());
    if(ch=='-'){
        t=-1;
    }
    else{
        t=1;
    }
    for(;!isdigit(ch);ch=getchar());
    for(;isdigit(ch);ch=getchar()){
        p=p*10+ch-48;
    }
    return t*p;
}

struct seqTree{
#define lc (o<<1)
#define rc ((o<<1)|1)
#define MID ((L+R)>>1)
#define ll long long
    int n;
    vector<ll> addv;
    vector<ll> sumv;
    vector<ll> A;
    void treeClear(){
        addv.clear();
        sumv.clear();
        A.clear();
    }

    void treeResize(int n){
        addv.resize(n<<2);
        sumv.resize(n<<2);
    }

    seqTree():n(0){
        treeClear();
    }

    seqTree(int n):n(n),A(n+2),addv(n<<2),sumv(n<<2){}

    void maintain(int o,int L,int R)
    {
        if(L==R){
            sumv[o]=A[L];
        }
        if(R>L){
            sumv[o]=sumv[lc]+sumv[rc];
        }
    }

    void dfsBuild(int o,int L,int R)
    {
        if(L==R){
            sumv[o]=A[L];
        }
        if(L<R){
            if(MID>=L) dfsBuild(lc,L,MID);
            if(MID<R) dfsBuild(rc,MID+1,R);
            maintain(o,L,R);
        }
    }

    void build(vector<ll> X,unsigned int L,unsigned int R)
    {
        if(X.empty()) return;
        R=min(R,(unsigned int)X.size());
        L=max(L,(unsigned int)0);
        treeClear();
        A.push_back(0);
        for(unsigned int i=L;i<R;i++){
            A.push_back(X[i]);
        }
        n=A.size()-1;
        treeResize(n);
        dfsBuild(1,1,A.size()-1);
    }

    seqTree(vector<ll> A)
    {
        build(A,0,A.size());
    }

    void updata(int o,int L,int R,int y1,int y2,ll v){
        if(y1<=L && y2>=R){
            addv[o]+=v;
            sumv[o]+=v*(R-L+1);
        }
        else{
            pushDown(o,L,R);
            if(y1<=MID) updata(lc,L,MID,y1,y2,v);
            if(y2>MID) updata(rc,MID+1,R,y1,y2,v);
            maintain(o,L,R);
        }
    }

    void pushDown(int o,int L,int R)
    {
        if(addv[o]!=0){
            addv[lc]+=addv[o];
            addv[rc]+=addv[o];
            sumv[lc]+=addv[o]*(MID-L+1);
            sumv[rc]+=addv[o]*(R-MID);
            addv[o]=0;
        }
    }

    ll getSum(int o,int L,int R,int y1,int y2)
    {
        if(y1<=L && y2>=R){
            return sumv[o];
        }
        pushDown(o,L,R);
        ll ret=0;
        if(y1<=MID) ret+=getSum(lc,L,MID,y1,y2);
        if(y2> MID) ret+=getSum(rc,MID+1,R,y1,y2);
        return ret;
    }
};

struct Node{
    ll a,b,c;
    Node():a(0),b(0),c(0){}
    Node(ll a,ll b,ll c):a(a),b(b),c(c){}
};

int n,m;
seqTree del;

int main()
{
    scanf("%d",&n);
    vector<long long> k,k2(n+1);
    k2[0]=0;
    for(int i=1;i<=n;i++){
        int a;
        scanf("%d",&a);
        k.push_back(0);
        k2[i]=k2[i-1]+a;
    }
    seqTree sum(k),del(k);
    scanf("%d",&m);
    for(int i=0;i<m;i++){
        int D,a,b;long long c;
        scanf("%d",&D);
        if(D==1){
            a=getint();
            b=getint();
            c=getLL();
            sum.updata(1,1,n,a,b,c);
            del.updata(1,1,n,a,b,c*i);
        }
        if(D==2){
            a=getint();
            b=getint();
            printf("%lld\n",sum.getSum(1,1,n,a,b)*i+k2[b]-k2[a-1]-del.getSum(1,1,n,a,b));
        }
    }
    return 0;
}

LOJ的dalao也给出了树状数组解法