摘要: #define lk k << 1 #define rk k << 1 | 1 #define mk (l + r) >> 1 const int maxn = 1e5 + 10; struct node {//权值线段树 int num, sum; }tree[maxn << 2]; int id 阅读全文
posted @ 2020-10-06 11:37 wansheking 阅读(91) 评论(0) 推荐(0)