摘要:
hdu 4267 A Simple Problem with Integers http://acm.hdu.edu.cn/showproblem.php?pid=4267多个树状数组,区间跟新,单点询问,转化为单点更新,求和View Code 1 #include <cstdio> 2 #include <cstring> 3 using namespace std; 4 5 const int N=50010; 6 int c[11][10][N]; 7 int a[N]; 8 int lowbit(int x) 9 {10 return x&(-x);11 阅读全文