[codevs1081]线段树基本操作

题目描述 Description
给你N个数，有两种操作


1：给区间[a,b]的所有数都增加X


2：询问第i个数是什么？

输入描述 Input Description
第一行一个正整数n，接下来n行n个整数，再接下来一个正整数Q，表示操作的个数. 接下来Q行每行若干个整数。如果第一个数是1，后接3个正整数a,b,X，表示在区间[a,b]内每个数增加X,如果是2，后面跟1个整数i, 表示询问第i个位置的数是多少。

输出描述 Output Description
对于每个询问输出一行一个答案

样例输入 Sample Input
3

1

2

3

2

1 2 3 2

2 3

样例输出 Sample Output
5

数据范围及提示 Data Size & Hint
数据范围

1<=n<=100000

1<=q<=100000

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

typedef long long ll;

const int N = 100000+10;

struct Node {
    ll flag,sum;
    Node *ls, *rs;
}pool[N*2+5], *tail = pool, *root;

int n,q;
int aa[N];

Node *build( int lf, int rg ) {
    Node *nd = ++tail;
    if( rg == lf ) {
        nd->sum = aa[lf];
        nd->flag = 0;
    } else {
        int mid = (lf + rg) >> 1;
        nd->ls = build( lf, mid );
        nd->rs = build( mid+1, rg );
        nd->sum = nd->ls->sum + nd->rs->sum;
        nd->flag = 0;
    }
    return nd;
}
void modify( Node *nd, int lf, int rg, int L, int R, int delta ) {
    if( L <= lf && rg <= R ) {
        nd->flag += delta;
        return;
    }
    int mid = (lf + rg) >> 1;
    if( L <= mid ) modify( nd->ls, lf, mid, L, R, delta );
    if( R > mid) modify( nd-> rs, mid+1, rg, L, R, delta );
    nd->sum = nd->ls->sum + nd->rs->sum + nd->ls->flag*(mid-lf+1) + nd->rs->flag*(rg-mid);
}
ll query( Node *nd, int lf, int rg, int L, int R ) {
    if( L <= lf && rg <= R ) {
        return nd->sum + nd->flag * (rg - lf + 1);
    }
    int mid = (lf + rg) >> 1;
    ll rt = (min(R,rg) - max(lf,L) + 1) * nd->flag;
    if( L <= mid ) rt += query( nd->ls, lf, mid, L, R );
    if( R > mid ) rt += query( nd->rs, mid+1, rg, L, R );
    return rt;
}
int main() {
    scanf("%d", &n);
    for( int i = 1; i <= n; i++ ) scanf("%d", &aa[i]);
    root = build( 1, n );
    scanf( "%d", &q );
    while(q--) {
        int yu;
        scanf("%d", &yu);
        if(yu == 1) {
            int a,b,c;
            scanf("%d%d%d", &a, &b, &c);
            modify( root, 1, n, a, b, c );
        } else {
            int x;
            scanf("%d", &x);
            cout << query( root, 1, n, x, x ) << endl;
        }
    }
    return 0;
}