摘要：
#include#include#include#include#include#include#include#include#include#include#include#include#define tree int o,int l,int r#define lson o>1; setv[o=r) { setv[o]=val; sum[o]=val*(r-l+1); } else { pushdown(o,l,r); int mid=(l+r)>>1; if(qlmid) ... 阅读全文
