poj 3468

最新推荐文章于 2020-03-21 13:10:11 发布

原创最新推荐文章于 2020-03-21 13:10:11 发布 · 224 阅读

0 ·

CC 4.0 BY-SA版权

poj 专栏收录该内容

25 篇文章

订阅专栏

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

/// TLE  edition !!!
/*
#include <iostream>
#include<cstdio>
using namespace std;
const int maxn = 100001;

int sum[maxn*4];
int v[maxn];
int n, m;
void build(int l, int r, int rt)
{
    sum[rt] = 0;
    if(l == r)
        return ;
    int m = (l+r)>>1;
    build(l, m, rt<<1);
    build(m+1, r, rt<<1|1);
}

int query(int ll, int rr, int l, int r, int rt)
{
    if(ll<=l && rr>=r)
    {
        return sum[rt];
    }

    int m = (l+r)>> 1;
    if(ll<m)
        query(ll, m, l, r, rt<<1);
    if(rr>=m)
        query(m+1, rr, l, r, rt<<1|1);
    sum[rt] = sum[rt<<1]+ sum[rt<<1|1];
}
void update(int ll, int rr, int v, int l, int r, int rt)
{
    if(ll<=l && rr>=r)
    {
        sum[rt] += v*(rr-ll+1);

        return ;
    }
    int m = (ll+rr)>>1;
    if(ll < m)
    update(ll, m, v, l, r, rt<<1);
    if(rr >= m)
    update(m+1, rr, v, l, r, rt<<1|1);
}
int main()
{

    char c;
    int a, b, v;
    cin >> n >> m;
    build(1, n, 1);
    for(int i=1; i<=n; i++)
    {
        scanf("%d", &v);
        update(i, i, v, 1, n, 1);
    }
    for(int i=1; i<=m; i++)
    {
        scanf("%c", &c);
        if(c == 'Q')
        {
            scanf("%d%d", &a, &b);
            int ans = query(a, b, 1, n, 1);
            printf("%d\n", ans);

        }
        else
        {
            scanf("%d%d%d", &a, &b, &v);
            update(a, b, v, 1, n, 1);
        }
    }
    return 0;
}
*/
/*
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
*/
/*

4

55

9

15

Process returned 0 (0x0)   execution time : 4.933 s
Press any key to continue.

*/

<pre class="cpp" name="code">#include <stdio.h>
#include<iostream>
using namespace std;
#define maxn 111111

long long add[maxn<<2];
long long sum[maxn<<2];

void PushUP(int rt)
{
    sum[rt]=sum[rt<<1]+sum[rt<<1|1];
}

void PushDown(int rt,int m)
{
    if(add[rt])
    {
        add[rt<<1]+=add[rt];
        add[rt<<1|1]+=add[rt];
        sum[rt<<1]+=(m-(m>>1))*add[rt];
        sum[rt<<1|1]+=(m>>1)*add[rt];
        add[rt]=0;
    }
}

void Build(int l,int r,int rt)
{
    add[rt]=0;
    if(l==r)
    {
        scanf("%I64d",&sum[rt]);
        return;
    }
    int m=(l+r)>>1;
    Build(l,m,rt<<1);
    Build(m+1,r,rt<<1|1);
    PushUP(rt);
}

void Update(int L,int R,int c,int l,int r,int rt)
{
    if(L<=l&&R>=r)                           ///[L, R]   update
    {
        add[rt]+=c;             ///   L and R stay stay      
        sum[rt]+=(long long)c*(r-l+1);   ///   l   gets bigger    and  r  gets smaller
        return;                       ///finally     L<= l     and   R>=r
    }
    PushDown(rt,r-l+1);
    int m=(l+r)>>1;
    if(L<=m)
        Update(L,R,c,l,m,rt<<1);
    if(R>m)
        Update(L,R,c,m+1,r,rt<<1|1);
    PushUP(rt);
}

long long Query(int L,int R,int l,int r,int rt)///   [L, R]  query 
{
    if(L<=l&&R>=r)
        return sum[rt];
    PushDown(rt,r-l+1);
    int m=(l+r)>>1;
    long long ret=0;
    if(L<=m)   ret+=Query(L,R,l,m,rt<<1);
    if(R>m)    ret+=Query(L,R,m+1,r,rt<<1|1);
    return ret;
}

int main()
{
    int n, m;
    scanf("%d%d",&n,&m);
    Build(1,n,1);
    while(m--)
    {
        char s[5];
        int a,b,c;
        scanf("%s", s);
        if(s[0]=='Q')
        {

            scanf("%d%d",&a,&b);

            printf("%I64d\n",Query(a,b,1,n,1));
        }
        else
        {
            scanf("%d%d%d",&a,&b,&c);
            Update(a,b,c,1,n,1);
        }
    }
    return 0;
}

#include <stdio.h>#include<iostream>using namespace std;#define maxn 111111long long add[maxn<<2];long long sum[maxn<<2];void PushUP(int rt){ sum[rt]=sum[rt<<1]+sum[rt<<1|1];}void PushDown(int rt,int m){ if(add[rt]) { add[rt<<1]+=add[rt]; add[rt<<1|1]+=add[rt]; sum[rt<<1]+=(m-(m>>1))*add[rt]; sum[rt<<1|1]+=(m>>1)*add[rt]; add[rt]=0; }}void Build(int l,int r,int rt){ add[rt]=0; if(l==r) { scanf("%I64d",&sum[rt]); return; } int m=(l+r)>>1; Build(l,m,rt<<1); Build(m+1,r,rt<<1|1); PushUP(rt);}void Update(int L,int R,int c,int l,int r,int rt){ if(L<=l&&R>=r) ///[L, R] update { add[rt]+=c; sum[rt]+=(long long)c*(r-l+1); return; } PushDown(rt,r-l+1); int m=(l+r)>>1; if(L<=m) Update(L,R,c,l,m,rt<<1); if(R>m) Update(L,R,c,m+1,r,rt<<1|1); PushUP(rt);}long long Query(int L,int R,int l,int r,int rt)/// [L, R] query { if(L<=l&&R>=r) return sum[rt]; PushDown(rt,r-l+1); int m=(l+r)>>1; long long ret=0; if(L<=m) ret+=Query(L,R,l,m,rt<<1); if(R>m) ret+=Query(L,R,m+1,r,rt<<1|1); return ret;}int main(){ int n, m; scanf("%d%d",&n,&m); Build(1,n,1); while(m--) { char s[5]; int a,b,c; scanf("%s", s); if(s[0]=='Q') { scanf("%d%d",&a,&b); printf("%I64d\n",Query(a,b,1,n,1)); } else { scanf("%d%d%d",&a,&b,&c); Update(a,b,c,1,n,1); } } return 0;}