摘要:
http://acm.hdu.edu.cn/showproblem.php?pid=1892二维树状数组,很裸。。。View Code #include <iostream>#include <algorithm> #include <cstring>using namespace std;const int MAX=1010;int weight[MAX][MAX],tree[MAX][MAX];int lowbit(int i){ return i&(-i);}void update(int x,int y,int val){ for(int i 阅读全文