摘要： http://poj.org/problem?id=1195简单二维线段树题。单点更新区间求和。My Code 1 #include <cstdio> 2 #include <algorithm> 3 using namespace std; 4 #define lson l,m,rt<<1 5 #define rson m+1,r,rt<<1|1 6 #define maxn 1024 7 int n; 8 struct node 9 {10 int setree1[maxn<<1];11 }setree[maxn<<1 阅读全文

摘要： Incredible Crazily Progressing Company (ICPC) suffered a lot with the low speed of procedure. After investigation, they found that the bottleneck was at Absolutely Crowded Manufactory (ACM). In oder to accelerate the procedure, they bought a new machine for ACM. But a new problem comes, how to place 阅读全文