【HDOJ】5057 Argestes and Sequence

树状数组，其实很简单。只是MLE。

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

#define MAXN 100005

short sum[10][10][MAXN];
char bit[10][10][MAXN];
int a[MAXN];
int t, n, m;
int d, p;
const int MOD = 32768;

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

int getSum(int x, int d, int p) {
    int ret = 0;
    while (x > 0) {
        ret += (int)sum[d][p][x] + ((int)bit[d][p][x]) * MOD;
        x -= lowbit(x);
    }
    return ret;
}

void update(int x, int d, int p, int r) {
    int tmp;
    while (x <= n) {
        tmp = (int)sum[d][p][x] + r;
        sum[d][p][x] = tmp%MOD;
        bit[d][p][x] += tmp/MOD;
        x += lowbit(x);
    }
}

int query(int l, int r) {
    return getSum(r, d-1, p) - getSum(l-1, d-1, p);
}

void insert(int x, int i, int delta) {
    int j;
    for (j=1; j<=10; ++j) {
        update(i, j-1, x%10, delta);
        x /= 10;
    }
}

int main() {
    int i, j, ans;
    int x, y;
    char cmd[3];

    scanf("%d", &t);
    while (t--) {
        scanf("%d %d", &n, &m);
        for(i=0; i<10; i++) {
            for(j=0; j<10; j++) {
                memset(sum[i][j], 0, sizeof(short)*(n+1));
                memset(bit[i][j], 0, sizeof(char)*(n+1));
            }
        }
        for (i=1; i<=n; ++i) {
            scanf("%d", &a[i]);
            insert(a[i], i, 1);
        }
        while (m--) {
            scanf("%*c%s %d %d", cmd, &x, &y);
            if (cmd[0] == 'S') {
                insert(a[x], x, -1);
                a[x] = y;
                insert(a[x], x, 1);
            } else {
                scanf("%d %d", &d, &p);
                ans = query(x, y);
                printf("%d
", ans);
            }
        }
    }

    return 0;
}