摘要：
http://www.nocow.cn/index.php/Translate:URAL/1097#include#include#include#include#include#include#include#include#include#include#include#include#define tree int o,int l,int r#define lson oa.d; }} node[M];void update(tree){ if(ql=r) { sum[o]=r-l+1; } else if(sum[o]==r-l+1) ... 阅读全文
