poj3468--A Simple Problem with Integers（树状数组解法）

最新推荐文章于 2019-05-30 20:44:42 发布

刀刀狗0102

最新推荐文章于 2019-05-30 20:44:42 发布

阅读量1k

点赞数 1

分类专栏：数据结构

本文链接：https://blog.csdn.net/winddreams/article/details/38126029

版权

数据结构专栏收录该内容

85 篇文章 1 订阅

订阅专栏

A Simple Problem with Integers

Time Limit: 5000MS		Memory Limit: 131072K
Total Submissions: 59247		Accepted: 18032
Case Time Limit: 2000MS

Description

You have N integers, A₁, A₂, ... , A_N. 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 A₁, A₂, ... , A_N. -1000000000 ≤ A_i ≤ 1000000000.
Each of the next Q lines represents an operation.
"C a b c" means adding c to each of A_a, A_a₊₁, ... , A_b. -10000 ≤ c ≤ 10000.
"Q a b" means querying the sum of A_a, A_a₊₁, ... , A_b.

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.

Source

POJ Monthly--2007.11.25, Yang Yi

出自http://kenby.iteye.com/blog/962159

给出n个数，m次操作，Q x y 询问[x，y]的和，C x y b 在[x，y]中的每个数均加b

首先记录下由1到i的初始值（记录到a数组中），Q x y 的和 sum = a[y] - a[x-1] + S（操作改变的值），定义一个数组k[]，k[i]表示为由i到n的所有值均加k[i],那么C x y b 表示为：k[x]+b,k[y+1]-b ；S = Sy - S(x-1) ；Si = a[1]*i+a[2]*(i-1)+。。a[i]*1 ----->>> Si = (i+1)*(k[1]+k[2]+k[3]。。k[i]) - (k[1]*1+k[2]*2+k[3]*3。。k[i]*i) ;

由此转化为了要求k[1]累加到k[i]的和，k[1]*1累加到k[i]*i的和，使用树状数组可以log(n)的时间求到结果

#include <cstdio>
#include <cstring>
#define LL long long int
LL a[100010] , b[100010] , c[100010] ;
int lowbit(int x)
{
    return x & -x;
}
void add(LL *s,int i,int x,int n)
{
    while( i <= n )
    {
        s[i] += x ;
        i += lowbit(i) ;
    }
}
LL get(LL *s,int i)
{
    LL sum = 0;
    while( i )
    {
        sum += s[i] ;
        i -= lowbit(i) ;
    }
    return sum;
}
LL f(int i)
{
    LL sum = a[i] ;
    sum +=  ( (i+1)*get(b,i) - get(c,i) ) ;
    return sum ;
}
int main()
{
    int i , n , m , l , r ;
    LL x , sum ;
    char ch ;
    memset(a,0,sizeof(a));
    memset(b,0,sizeof(b));
    memset(c,0,sizeof(c));
    scanf("%d %d", &n, &m);
    for(i = 1 ; i <= n ; i++)
    {
        scanf("%lld", &x);
        a[i] += a[i-1] + x ;
    }
    while(m--)
    {
        getchar();
        scanf("%c", &ch);
        if(ch == 'Q')
        {
            scanf("%d %d", &l, &r);
            sum = f(r) - f(l-1) ;
            printf("%lld\n", sum) ;
        }
        else
        {
            scanf("%d %d %d", &l, &r, &x);
            add(b,l,x,n) ;
            add(b,r+1,-x,n);
            add(c,l, x*l ,n);
            add(c,r+1, -(x*(r+1)),n);
        }
    }
    return 0;
}