20140719 「树状数组 - 区间更新，区间求和」 POJ 3468 A Simple Problem with Integers

Online Judge	Problem Set	Authors	Online Contests	User
Web Board Home Page F.A.Qs Statistical Charts	Problems Submit Problem Online Status Prob.ID:	Register Update your info Authors ranklist	Current Contest Past Contests Scheduled Contests Award Contest	wilson1068      Log Out Mail:0(0) Login Log      Archive

Language: Default A Simple Problem with Integers Time Limit: 5000MS   Memory Limit: 131072K Total Submissions: 58536   Accepted: 17827 Case Time Limit: 2000MS Description You have N integers, A1, A2, ... , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given interval. The other is to ask for the sum of numbers in a given interval. Input The first line contains two numbers N and Q. 1 ≤ N,Q ≤ 100000. The second line contains N numbers, the initial values of A1, A2, ... , AN. -1000000000 ≤ Ai ≤ 1000000000. Each of the next Q lines represents an operation. "C a b c" means adding c to each of Aa, Aa+1, ... , Ab. -10000 ≤ c ≤ 10000. "Q a b" means querying the sum of Aa, Aa+1, ... , Ab. Output You need to answer all Q commands in order. One answer in a line. Sample Input 10 5 1 2 3 4 5 6 7 8 9 10 Q 4 4 Q 1 10 Q 2 4 C 3 6 3 Q 2 4 Sample Output 4 55 9 15 Hint The sums may exceed the range of 32-bit integers. Source POJ Monthly--2007.11.25, Yang Yi

[Submit]   [Go Back]   [Status]   [Discuss]

Home Page   Go Back  To top

---

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator

#include <stdio.h>
#include <string.h>
#define MAXN 101000
#define lowbit(x) ((x)&(-x))
int n, m;
long long a[MAXN], b[MAXN], c[MAXN];

void add(long long s[], int i, int x){
    for( ; i<=n; i+=lowbit(i))  s[i] += x;
}

long long sum(long long s[], int i){
    long long ret = 0;
    for( ; i>0; i-=lowbit(i) )
        ret += s[i];
    return ret;
}

long long sum_ans(int i){
    return (i+1)*sum(b, i) - sum(c, i);
}

int main(){           
    long long L, R, x;
    while( ~scanf("%d%d", &n, &m) ){
        a[0] = 0;
        for(int i=1; i<=n; i++){
            scanf("%lld", &a[i]);
            a[i] += a[i-1];
        }
        char s[10];
        while( m-- ){
            scanf("%s", s);
            if( 'Q'==s[0] ){
                scanf("%lld%lld", &L, &R);
                long long ans = a[R]-a[L-1] +sum_ans(R)-sum_ans(L-1);
                printf("%lld\n", ans );
            }
            else {
                scanf("%lld%lld%lld", &L, &R, &x);
                add(b, L, x);                   add(b, R+1, -x);
                add(c, L, x*L);                 add(c, R+1, -x*(R+1));
            }
        }
    }
    return 0;
}