poj3468 - A Simple Problem with Integers - 树状数组（区间更新、区间查询）

最新推荐文章于 2020-05-15 23:49:15 发布

努力写题的tyf

最新推荐文章于 2020-05-15 23:49:15 发布

阅读量167

点赞数

分类专栏：树状数组文章标签：树状数组

本文链接：https://blog.csdn.net/m0_37579232/article/details/99857405

版权

树状数组专栏收录该内容

7 篇文章 0 订阅

订阅专栏

A Simple Problem with Integers

Time Limit: 5000MS		Memory Limit: 131072K
Total Submissions: 168624		Accepted: 51960
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

Hint

The sums may exceed the range of 32-bit integers.

思路：

（写了好多bug才AC……）

原数组 a：1 2 3 4 5 6 7 8 9 10

差分数组d：1 1 1 1 1 1 1 1 1 1 （d[i]=a[i]-a[i-1]）

此时我们要求元素a[i]： $a[i]=\sum_{j=1}^{i}b[j]$

那么a[1]到a[i]的和： $sum[i]=\sum_{j=1}^{i}a[j]=i*d[1]+(i-1)*d[2]+(i-2)*d[3]+...+1*d[i]$

$=\sum_{j=1}^{i}(i-j+1)*d[j]$

$=(i+1)\sum_{j=1}^{i}d[j]-\sum_{j=1}^{i}d[j]*j$

所以设两个树状数组 $sum1[i]=\sum_{j=1}^{i}d[j]$ 与 $sum2[i]=\sum_{j=1}^{i}d[j]*j$

这两个数组的用法，类比普通的树状数组，进行更新和查询。

代码如下：

#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<cstring>
#include<set>
#include<map>
#include<queue>
#include<vector>
#include<cmath>
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define ll long long
using namespace std;
const int N=100005;
const int INF=0x3f3f3f3f;

ll a[N],d[N],sum1[N],sum2[N],n;

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

ll sum(ll x){
    ll res=0;
    ll p=x;
    while(x>0){
        res+=(p+1)*sum1[x]-sum2[x];
        x-=lowbit(x);
    }
    return res;
}

ll range_ask(ll l,ll r){
    return sum(r)-sum(l-1);
}

void add(ll x,ll m){
    ll x1=x;
    while(x<=n){
        sum1[x]+=m;
        sum2[x]+=x1*m;
        x+=lowbit(x);
    }
}

void range_add(ll l,ll r,ll x){
    add(l,x);
    add(r+1,-x);
}

int main(){
    int q;
    scanf("%lld%d",&n,&q);
    for(ll i=1;i<=n;i++){
        scanf("%lld",&a[i]);
        d[i]=a[i]-a[i-1];
    }
    for(ll i=1;i<=n;i++){//赋初值
        add(i,d[i]);
    }
    char s[5];
    ll l,r;
    while(q--){
        scanf("%s%lld%lld",s,&l,&r);
        if(s[0]=='Q'){
            ll ans=range_ask(l,r);
            printf("%lld\n",ans);
        }
        else{
            ll x;
            scanf("%lld",&x);
            range_add(l,r,x);
        }
    }
}