随笔分类 -  线段树

摘要:维护区间加法 https://www.luogu.com.cn/problem/P3374 #include<bits/stdc++.h> using namespace std; typedef long long ll; const int maxN=500000; struct Node{ i 阅读全文
posted @ 2020-05-23 17:17 ___Charles 阅读(111) 评论(0) 推荐(0)