POJ 3468 A Simple Problem with Integers

~~~题目链接~~~

思路：线段树， 更新区间求区间。

code：

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define N 100002
//typedef __int64_t __int64;
using namespace std;
int n = 0, q = 0;
__int64 t[4*N], cv[4*N];

void build(int c, int l, int r)
{
    int m = l+(r-l)/2;
    cv[c] = 0;
    if(l == r)
    {
        scanf("%I64d", &t[c]);
        return ;
    }
    build(2*c, l, m);
    build(2*c+1, m+1, r);
    t[c] = t[2*c]+t[2*c+1];
}

void cover(int c, int l, int r)
{
    int m = l+(r-l)/2;
    cv[2*c] += cv[c];
    cv[2*c+1] += cv[c];
    //cv[2*c] += cv[2*c+1] += cv[c];
    t[2*c] += (m-l+1)*cv[c];
    t[2*c+1] += (r-m)*cv[c];
    cv[c] = 0;
}

__int64 query(int c, int l, int r, int lf, int rt)
{
    int m = l+(r-l)/2;
    __int64 ans = 0;
    if(cv[c] != 0 && l != r)
        cover(c, l, r);
    if(lf<=l && rt>=r)
        return t[c];
    if(lf<=m) ans = query(2*c, l, m, lf, rt);
    if(rt>m) ans += query(2*c+1, m+1, r, lf, rt);
    return ans;
}



void update(int c, int l, int r, int lf, int rt, int w)
{
    int m =l+(r-l)/2;
    if(cv[c] != 0 && l != r)
        cover(c, l, r);
    if(lf<=l && rt>=r)
    {
        cv[c] += w;
        if(l == r)
            cv[c] = 0;
        t[c] += (r-l+1)*w;
        return ;
    }
   // if(lf<=m)update(2*c, l, m, lf, rt, w);
   // if(rt>m) update(2*c+1, m+1, r, lf, rt, w);
    if(rt<=m) update(2*c, l, m, lf, rt, w);
    else if(lf>m) update(2*c+1, m+1, r, lf, rt, w);
    else
    {
        update(2*c, l, m, lf, m, w);
        update(2*c+1, m+1, r, m+1, rt, w);
    }
    t[c] = t[2*c]+t[2*c+1];
}

int main()
{
    //freopen("input.txt", "r", stdin);
    int i = 0, j = 0, x = 0, y = 0, z = 0;
    char ch = 0;
    while(scanf("%d %d", &n, &q) != EOF)
    {
        memset(t, 0, sizeof(t));
        build(1, 1, n);
        getchar();
        for(i = 0; i<q; i++)
        {
            scanf("%c %d %d", &ch, &x, &y);
            getchar();
            if(ch == 'Q')
                printf("%I64d\n", query(1, 1, n, x, y));
            else
            {
                scanf("%d", &z);
                getchar();
           //     printf("%I64d\n", query(1, 1, n, 6, 10));
                update(1, 1, n, x, y, z);
            }
        }
    }
    return 0;
}