摘要: ###可持久化线段树2 #include<cstdio> #include<iostream> #include<algorithm> using namespace std; const int MAXN=1e6+5; struct ren{ int l,r,sum; }t[MAXN<<5]; i 阅读全文
posted @ 2022-02-22 16:49 StranGePants 阅读(16) 评论(0) 推荐(0) 编辑