DTL66的博客

int lowbit(int x)//计算更新需要的增量 { return x&(-x);//return x&(x^(x-1)) }一维树状数组： 局限性：只适用于对点更新和对区间查询; 如果对求区间最值不能用，得用线段树；如果要进行区间的更新和点的查询，可以将Update() 和sum（）的内部更新顺序转变，但此时c[]数已不是定义的树状数组了。void add(int pos,i

Minimum Inversion Number Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 18906Accepted Submission(s): 11415 Problem Description...

D. Nested Segments time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output You are given n segments on a line. Ther

敌兵布阵 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 80748    Accepted Submission(s): 34104 Problem Description C国的死对头A国这段时间正