bzoj 3212 线段树

　　裸的线段树

/**************************************************************
    Problem:
    User: BLADEVIL
    Language: Pascal
    Result: Accepted
    Time: ms
    Memory: kb
****************************************************************/

//By BLADEVIL
type
    rec                 =record
        left, right     :longint;
        sum, lazy       :int64;
    end;

var
    n, m                :longint;
    a                   :array[..] of int64;
    t                   :array[..] of rec;

procedure swap(var a,b:longint);
var
    c                   :longint;
begin
    c:=a; a:=b; b:=c;
end;

procedure build(x,l,r:longint);
var
    mid                 :longint;
begin
    t[x].left:=l; t[x].right:=r;
    if l=r then
    begin
        t[x].sum:=a[l];
        exit;
    end;
    with t[x] do mid:=(l+r)>>;
    build(*x,l,mid); build(*x+,mid+,r);
    t[x].sum:=(t[*x].sum+t[*x+].sum);
end;

procedure change(x,l,r:longint;y:int64);
var
    mid                 :longint;
begin
        if t[x].lazy<> then
    begin
        t[*x].sum:=t[*x].sum+t[x].lazy*(t[*x].right-t[*x].left+);
        t[*x].lazy:=t[*x].lazy+t[x].lazy;
        t[*x+].sum:=t[*x+].sum+t[x].lazy*(t[*x+].right-t[*x+].left+);
        t[*x+].lazy:=t[*x+].lazy+t[x].lazy;
        t[x].lazy:=;
    end;

    if (t[x].left=l) and (t[x].right=r) then
    begin
        t[x].lazy:=y;
        t[x].sum:=t[x].sum+y*(t[x].right-t[x].left+);
        exit;
    end;
    with t[x] do mid:=(left+right)>>;
    if mid<l then change(*x+,l,r,y) else
    if mid>=r then change(*x,l,r,y) else
    begin
        change(*x,l,mid,y);
        change(*x+,mid+,r,y);
    end;
    t[x].sum:=t[*x].sum+t[*x+].sum;
end;

function ask(x,l,r:longint):int64;
var
    mid                 :longint;
begin
    if t[x].lazy<> then
    begin
        t[*x].sum:=t[*x].sum+t[x].lazy*(t[*x].right-t[*x].left+);
        t[*x].lazy:=t[*x].lazy+t[x].lazy;
        t[*x+].sum:=t[*x+].sum+t[x].lazy*(t[*x+].right-t[*x+].left+);
        t[*x+].lazy:=t[*x+].lazy+t[x].lazy;
        t[x].lazy:=;
    end;

    if (t[x].left=l) and (t[x].right=r) then exit(t[x].sum);

    with t[x] do mid:=(left+right)>>;
    if mid<l then exit(ask(*x+,l,r)) else
    if mid>=r then exit(ask(*x,l,r)) else
    exit(ask(*x,l,mid)+ask(*x+,mid+,r));
end;

procedure init;
var
    i                   :longint;
begin
    readln(n,m);
    for i:= to n do read(a[i]);
    readln;
    build(,,n);
end;

procedure main;
var
    i                   :longint;
    ch                  :char;
    l, r                :longint;
    x                   :int64;
begin
    for i:= to m do
    begin
        read(ch);
        if ch='C' then
        begin
            readln(l,r,x);
            if l>r then swap(l,r);
            change(,l,r,x);
        end else
        begin
            readln(l,r);
            if l>r then swap(l,r);
            writeln(ask(,l,r));
        end;
    end;
end;

begin
    init;
    main;
end.