HDU 4267 A Simple Problem with Integers （线段树）

题意:

$N <= 5×10^4, 每次将区间[a,b]内满足(i-a)\%k=0(i \in[a,b])的数A_i增加c, 最后单点查询值$

分析:

• $移项发现, 其实就是每次更新i\%k = a\%k的数$, 然后单独维护一下
• $很裸的区间增减, 单点查询的模型, 但是好久没写BIT了我没有看出来, 就想着线段树去了, 然后只有单点查询的, 我维护了区间增减值的和。。$
• $这题有意卡空间- - MLE了很多发, 最后才反应过只要维护区间增减值就好了, 然后线段树还是MLE$
  $没办法只能把add[k][mod]离散化到add[55]才勉强过。。$
• $蓝儿BIT少常数倍空间很轻松就过了, 都不用离散化$

代码:
线段树:

//
//  Created by TaoSama on 2015-09-30
//  Copyright (c) 2015 TaoSama. All rights reserved.
//
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>

using namespace std;
#define pr(x) cout << #x << " = " << x << "  "
#define prln(x) cout << #x << " = " << x << endl
const int N = 5e4 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7;

int n, q, A[N];
int id[11][10];

#define root 1, n, 1
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1

int add[N << 2][55];
bool lazy[N << 2];

int cur;

void push_down(int rt) {
    if(lazy[rt]) {
        for(int i = 0; i < 55; ++i) {
            add[rt << 1][i] += add[rt][i];
            add[rt << 1 | 1][i] += add[rt][i];
            add[rt][i] = 0;
        }
        lazy[rt << 1] = lazy[rt << 1 | 1] = lazy[rt];
        lazy[rt] = 0;
    }
}
void build(int l, int r, int rt) {
    lazy[rt] = 0;
    for(int i = 0; i < 55; ++i) add[rt][i] = 0;
    if(l == r) return;
    int m = l + r >> 1;
    build(lson);
    build(rson);
}
void update(int L, int R, int v, int l, int r, int rt) {
    if(L <= l && r <= R) {
        lazy[rt] = 1;
        add[rt][cur] += v;
        return;
    }
    int m = l + r >> 1;
    push_down(rt);
    if(L <= m) update(L, R, v, lson);
    if(R > m) update(L, R, v, rson);
}
int query(int o, int l, int r, int rt) {
    if(l == r) {
        int ret = A[l];
        for(int k = 1; k <= 10; ++k) ret += add[rt][id[k][o % k]];
        return ret;
    }
    int m = l + r >> 1;
    push_down(rt);
    if(o <= m) return query(o, lson);
    else return query(o, rson);
}


void gao() {
    int cnt = 0;
    for(int i = 1; i <= 10; ++i) for(int j = 0; j < i; ++j) id[i][j] = cnt++;
    //cnt = 55;
}

int main() {
#ifdef LOCAL
    freopen("in.txt", "r", stdin);
//  freopen("out.txt","w",stdout);
#endif
    ios_base::sync_with_stdio(0);

    gao();
    while(scanf("%d", &n) == 1) {
        for(int i = 1; i <= n; ++i) scanf("%d", A + i);
        scanf("%d", &q);
        build(root);
        while(q--) {
            int op, a; scanf("%d%d", &op, &a);
            if(op == 1) {
                int b, k, c; scanf("%d%d%d", &b, &k, &c);
                cur = id[k][a % k];
                update(a, b, c, root);
            } else printf("%d\n", query(a, root));
        }
    }
    return 0;
}

BIT:

//
//  Created by TaoSama on 2015-09-30
//  Copyright (c) 2015 TaoSama. All rights reserved.
//
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>

using namespace std;
#define pr(x) cout << #x << " = " << x << "  "
#define prln(x) cout << #x << " = " << x << endl
const int N = 5e4 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7;

int n, q, A[N];
int b[11][10][N];

void add(int k, int mod, int i, int v) {
    for(; i <= n; i += i & -i) b[k][mod][i] += v;
}

int sum(int k, int mod, int i) {
    int ret = 0;
    for(; i; i -= i & -i) ret += b[k][mod][i];
    return ret;
}

int main() {
#ifdef LOCAL
    freopen("in.txt", "r", stdin);
//  freopen("out.txt","w",stdout);
#endif
    ios_base::sync_with_stdio(0);

    while(scanf("%d", &n) == 1) {
        for(int i = 1; i <= n; ++i) scanf("%d", A + i);
        scanf("%d", &q);
        memset(b, 0, sizeof b);
        while(q--) {
            int op, a; scanf("%d%d", &op, &a);
            if(op == 1) {
                int b, k, c; scanf("%d%d%d", &b, &k, &c);
                add(k, a % k, a, c);
                add(k, a % k, b + 1, -c);
            } else {
                int ans = A[a];
                for(int k = 1; k <= 10; ++k) ans += sum(k, a % k, a);
                printf("%d\n", ans);
            }
        }
    }
    return 0;
}