Queries Gym - 100741A 树状数组

最新推荐文章于 2017-08-23 00:51:31 发布

Joey丶sunk

最新推荐文章于 2017-08-23 00:51:31 发布

阅读量261

点赞数 1

分类专栏：树状数组

本文链接：https://blog.csdn.net/xiang_6/article/details/77488269

版权

树状数组专栏收录该内容

10 篇文章 0 订阅

订阅专栏

维护 m 个树状数组、

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <ctype.h>
#include <vector>
#include <algorithm>
// cout << "  ===  " << endl;

using namespace std;
typedef long long ll;
const int maxn = 10000 + 7;
const ll INF = 0x3f3f3f3f3f3f3f3f;// mod = 1e9+7;
ll n, m, mod;
ll a[maxn];
ll c[maxn][20];

int lowbit(int x) {
    return x&(-x);
}

void add(int pos, ll v, int mod) {
    while(pos <= n) {
        c[pos][mod] += v;
        pos += lowbit(pos);
    }
}

ll sum(int pos, int mod) {
    ll ans = 0;
    while(pos > 0) {
        ans += c[pos][mod];
        pos -= lowbit(pos);
    }
    return ans;
}

void solve() {
    for(int i = 1; i <= n; ++i) {
        //scanf("%d", &a[i]);
        cin >> a[i];
        add(i, a[i], (a[i]%m));
    }
    int k; cin >> k;
    //getchar();
    string s;
    for(int y = 0; y < k; ++y) {
        cin >> s;
        if(s[0] == 's') {
            ll i, j, l;
            cin >> i >> j >> l;
            cout << sum(j, l) - sum(i-1, l) << endl;
        }
        else if(s[0] == '+') {
            ll i, j;
            cin >> i >> j;
            add(i, -a[i], a[i]%m);
            a[i] += j;
            add(i, a[i], a[i]%m);
            cout << a[i] << endl;
        }
        else if(s[0] == '-'){
            ll i, j;
            cin >> i >> j;
            add(i, -a[i], a[i]%m);
            if(a[i] >= j) a[i] -= j;
            add(i, a[i], a[i]%m);
            cout << a[i] << endl;
        }
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin >> n >> m;
    //init();
    solve();

    return 0;
}