树状数组

最新推荐文章于 2024-07-02 22:40:02 发布

Byte97

最新推荐文章于 2024-07-02 22:40:02 发布

阅读量340

点赞数

分类专栏：数据结构文章标签：树状数组

本文链接：https://blog.csdn.net/Free__Radical/article/details/39935609

版权

数据结构专栏收录该内容

6 篇文章 0 订阅

订阅专栏

树状数组就线段树来说无法进行区间修改和求最值

program pro;
type mine=array[0..100000]of longint;
var
        n,m:longint;
        a,b:mine;
        st,i,j,x,y:longint;

function f(xx:longint):longint;
begin
        exit(xx and (-xx));
end;

procedure plus(var sz:mine; xx:longint);//修改
var     tmp:longint;

begin
        while (xx<=n) do
        begin
                inc(sz[xx]);
                inc(xx,f(xx));
        end;
end;

function sum(var sz:mine; xx:longint):longint;//求和
var     tot:longint;
begin
        tot:=0;
        while xx>0 do
        begin
                inc(tot,sz[xx]);
                dec(xx,f(xx));
        end;
        exit(tot);
end;

begin
        readln(n,m);
        for i:=1 to m do
        begin
                read(st,x,y);
                if st=1 then
                begin
                        plus(a,x);
                        plus(b,y);
                end
                else
                begin
                        writeln(sum(a,y)-sum(b,x-1));
                end;
        end;
end.