D 动态序列

题目链接：2021年广东工业大学第十五届文远知行杯程序设计竞赛（同步赛）D

题目大意

n个数q次询问，每次询问分五种，op=1表示序列中所有数乘k，op=2表示序列中所有数加上k，op=3表示序列头部增加一个整数k，op=4表示序列尾部增加一个整数k，op=5表示输出序列第k个位置的数，结果对qe9+7取模。

思路

就是线段树先乘后加，最后输出区间和，不过这里的区间是单点。可以用l表示区间左端点，r表示区间右端点。先跑一边询问，用双向队列方便首尾加数，看最后序列一共的个数len用于建树，然后更新查询。

ac代码

#include<bits/stdc++.h>
using namespace std;
//mt19937_64 rng(time(0));
#define io cin.tie(0);ios::sync_with_stdio(false);
#define ok(x, y) x >= 1 && x <= n && y >= 1 && y <= m
#define debug(x) cout<<#x<<"="<<x<<endl
#define lowbit(x) x&(-x)
#define pii pair<int,int>
#define mk make_pair
#define ll long long
#define ull unsigned long long
#define rs p<<1|1
#define ls p<<1
const int maxn = 2e5 + 5;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const ll INF = 1e18;
const int bas  = 233;
inline ll read(){
    ll p=0,f=1;char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
    while(c>='0'&&c<='9'){p=(p<<1)+(p<<3)+(c^48),c=getchar();}
    return f*p;
}
struct node{
    int l, r;
    ll sum, add, mut;
}tree[maxn << 2];
ll a[maxn];
int l1, r1;
void pushup(int p){
    tree[p].sum = (tree[ls].sum + tree[rs].sum) % mod;
}
void pushdown(int p){
    if(tree[p].add || tree[p].mut != 1){
        ll add = tree[p].add, mut = tree[p].mut;
        tree[ls].add = (tree[ls].add * mut % mod + add) % mod;
        tree[rs].add = (tree[rs].add * mut % mod + add) % mod;
        tree[ls].mut = tree[ls].mut * mut % mod;
        tree[rs].mut = tree[rs].mut * mut % mod;
        tree[ls].sum = (tree[ls].sum * mut % mod + add * (tree[ls].r - tree[ls].l + 1) % mod) % mod;
        tree[rs].sum = (tree[rs].sum * mut % mod + add * (tree[rs].r - tree[rs].l + 1) % mod) % mod;
        tree[p].add = 0, tree[p].mut = 1;
    }
}
void build(int p, int l, int r){
    tree[p].l = l, tree[p].r = r;
    tree[p].add = 0, tree[p].mut = 1;
    if(l == r){
        if(l >= l1 && l <= r1) //初始区间赋值
        tree[p].sum = a[l];
        else tree[p].sum = 0;
        return;
    }
    int mid = l + r >> 1;
    build(ls, l, mid);
    build(rs, mid + 1, r);
    pushup(p);
}
void update(int p, int l, int r, int k, int op){
    if(l <= tree[p].l && tree[p].r <= r){
        if(op == 1) { //加
            tree[p].add = (tree[p].add + k) % mod;
            tree[p].sum = (tree[p].sum + 1ll * k * (tree[p].r - tree[p].l + 1) % mod) % mod; 
        }else if(op == 2){ //乘
            tree[p].add = tree[p].add * k % mod;
            tree[p].mut = tree[p].mut * k % mod;
            tree[p].sum = tree[p].sum * k % mod;
        }
        return;
    }
    int mid = tree[p].l + tree[p].r >> 1;
    pushdown(p);
    if(mid >= l) update(ls, l, r, k, op);
    if(mid + 1 <= r) update(rs, l, r, k, op);
    pushup(p);
}
ll query(int p, int l, int r){
    if(l <= tree[p].l && tree[p].r <= r) return tree[p].sum;
    pushdown(p);
    int mid = tree[p].l + tree[p].r >> 1;
    ll ans = 0;
    if(mid >= l) ans = (ans + query(ls, l, r)) % mod;
    if(mid + 1 <= r) ans = (ans + query(rs, l, r)) % mod;
    return ans;
}
deque<int> q;
int x[maxn], y[maxn];
void solve(){
    int n, m;
    cin >> n >> m;
    for(int i = 1; i <= n; i ++){
        int x; cin >> x;
        q.push_back(x);
    }
    int l = 1, r;
    for(int i = 1; i <= m; i ++){
        cin >> x[i] >> y[i];
        if(x[i] == 3){ //序列头加数
            q.push_front(y[i]);
            l ++; //左端点要更新了
        }else if(x[i] == 4){ //序列尾加数
            q.push_back(y[i]);
        }
    }
    r = l + n - 1;
    l1 = l, r1 = r;
    int len = 0;
    while(q.size()){
        a[++len] = q.front(); q.pop_front();
    }
    build(1, 1, len); //建树
    for(int i = 1; i <= m; i ++){
        if(x[i] == 1) update(1, l, r, y[i], 2);
        else if(x[i] == 2) update(1, l, r, y[i], 1);
        else if(x[i] == 3){
            l --; //序列首加数，左端点左移
            update(1, l, l, y[i], 1); //单点加数
        }else if(x[i] == 4){
            r ++; //右端点右移
            update(1, r, r, y[i], 1); //单点加数
        }else {
            int d = l + y[i] - 1; //表示当前序列第y[i]个数
            cout << query(1, d, d) << endl;
        }
    }
}
int main(){
    // freopen("1.in", "r", stdin);
    // freopen("std.out", "w", stdout);
    // cout << fixed << setprecision(6)
    io;
    int t = 1;
    // cin >> t;
    while(t --){
        solve();
    }
    return 0;
}