传送门

直接搞就行。

注意下表re从零开始，而树状数组搞不了0，所以统一增加一个偏移量1.

（话说数据随机是什么鬼？）

1 # include <iostream> 2 # include <cstdio> 3 # include <cstring> 4 # include <string> 5 # include <cmath> 6 # include <vector> 7 # include <map> 8 # include <queue> 9 # include <cstdlib> 10 # define MAXN 1100 11 using namespace std; 12 13 inline int get_num() 20 21 int n; 22 int c[MAXN][MAXN]; 23 inline int lowbit(int x) 24 27 28 inline void add(int x, int y, int k) 29 35 36 inline int query(int x, int y) 37 44 45 int main() 46 60 else 61 68 } 69 return 0; 70 }
View Code