线段树POJ3468(成段更新，区间求和)
题目：A Simple Problem with Integers#include #define N 111111#define LL long long#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1LL add[N<<2];LL sum[N<<2];void PushUP(int rt){
无语烧鹅
他的归档
热门文章
