POJ 3468 A Simple Problem with Integers

题目：A Simple Problem with Integers

思路：
线段树区间修改区间查询裸题。
emm通过这题我深刻的感受到了string的效率…用string读字串就T了，改成char就过了Orz

代码:

#include<cstdio>
#include<iostream>
#include<string>
using namespace std;

#define maxn 100000
#define ll long long

struct Node {
    ll x;
    ll lzy;
    ll len;
};

ll n,m;
Node a[maxn*10+5];
ll c[maxn+5];
ll P,Q;

void push_down(ll o) {
    a[o*2].x+=a[o].lzy*a[o*2].len,a[o*2+1].x+=a[o].lzy*a[o*2+1].len;
    a[o*2].lzy+=a[o].lzy,a[o*2+1].lzy+=a[o].lzy;
    a[o].lzy=0;
}

void Add(ll o,ll L,ll R,ll k) {
    push_down(o);
    if(P<=L&&R<=Q) {
        a[o].lzy+=k;
        a[o].x+=k*a[o].len;
        return ;
    }
    if(P>R||Q<L) return ;
    ll mid=L+(R-L)/2;
    ll lch=o*2,rch=o*2+1;
    Add(lch,L,mid,k),Add(rch,mid+1,R,k);
    a[o].x=a[o*2].x+a[o*2+1].x;
    return ;
}

ll Query(ll o,ll L,ll R) {
    push_down(o);
    if(P<=L&&R<=Q) {
        return a[o].x;
    }
    if(P>R||Q<L) return 0;
    ll mid=L+(R-L)/2;
    ll lch=o*2,rch=o*2+1;
    return Query(lch,L,mid)+Query(rch,mid+1,R);
}

void make_tree(ll o,ll L,ll R) {
    if(L==R) {
        a[o].x=c[L];
        a[o].len=1;
        return ;
    }
    ll mid=L+(R-L)/2;
    ll lch=o*2,rch=o*2+1;
    make_tree(lch,L,mid),make_tree(rch,mid+1,R);
    a[o].x=a[o*2].x+a[o*2+1].x;
    a[o].len=(R-L+1);
}

int main() {
    scanf("%lld%lld",&n,&m);
    for(ll i=1; i<=n; i++) {
        scanf("%lld",&c[i]);
    }
    make_tree(1,1,n);
    while(m--) {
        char opr=' ';
        while(!isalpha(opr)) opr=getchar();
        scanf("%lld%lld",&P,&Q);
        if(opr=='Q') {
            ll ans=Query(1,1,n);
            printf("%lld\n",ans);
        } else {
            ll k;
            scanf("%lld",&k);
            Add(1,1,n,k);
        }
    }
    return 0;
}

数据生成器：

#include<bits/stdc++.h>
using namespace std;

#define maxn 100000
#define maxm 100000
#define maxa 100000
#define Rand() (rand()+rand()%1000000007)

int main() {
    srand(time(NULL));
    int n,m;
    n=Rand()%maxn+1;
    m=Rand()%maxm+1;
    printf("%d %d\n",n,m);
    for(int i=1;i<=n;i++) printf("%d ",Rand()%maxn+1);
    printf("\n");
    while(m--) {
        int opr=Rand()&1;
        if(opr==0) printf("Q ");
        else printf("C ");
        int l=1,r=0;
        while(l>r) {
            l=Rand()%n+1;
            r=n-Rand()%n;
        }
        printf("%d %d",l,r);
        if(opr==1) printf(" %d",Rand()%maxa);
        printf("\n");
    }

    return 0;
}