摘要：
线段树基本操作练习，防手生#include #include #include #define lson l, m, rt > 1 ) ); sum[rc] = lazy[rt]*( m >> 1 ); lazy[rt] = 0; } return;}void build( int l, int r, int rt ){ lazy[rt] = 0; sum[rt] = 1; if ( l == r ) return; int m = ( l + r ) >> 1; build( lson ); build( rson ... 阅读全文
