怎么做?

P2357 守墓人

```cpp var a:array[0..200001] of longint; n,m,i,j,k,ans,t,x,y,z:longint; begin assign(input,'tombkeeper.in');reset(input); assign(output,'tombkeeper.out');rewrite(output); readln(n,m); for i:=1 to n do read(a[i]); for i:=1 to m do begin read(k); case k of 1:begin readln(x,y,z); for j:=x to y do inc(a[j],z); end; 2:begin readln(x); inc(a[1],x); end; 3:begin readln(x); dec(a[1],x); end; 4:begin readln(x,y); for j:=x to y do inc(ans,a[j]); writeln(ans); ans:=0; end; 5:writeln(a[1]); end; end; close(input);close(output); end. ```
by 2017liziyang @ 2017-07-26 19:03:00


35分
by 2017liziyang @ 2017-07-26 19:03:18


没有文件输入输出
by 2017liziyang @ 2017-07-26 19:03:52


这题很水的好吧,裸的线段树
by 玫葵之蝶 @ 2017-09-11 14:48:48


@[利莫利亚扬](/space/show?uid=49938) 没开long long 就是35分
by Edgration @ 2017-10-11 21:00:31


线段树模板啊
by BriMon @ 2018-03-04 11:43:42


|