摘要: 树套树留坑 线段树套线段树: "K大数查询" ~~~c++ include include include include include include include include define rep(i,a,b) for(int i=(a);i=(b); i) using namespac 阅读全文
posted @ 2019-08-28 14:12 zmy蒟蒻 阅读(212) 评论(0) 推荐(0)