摘要: //线段树:单点修改+区间求和 #include<bits/stdc++.h> #define ll unsigned long long using namespace std; ll n,m,a[1000010],ans[2000010],tag[2000010]; ll ls(ll x) { 阅读全文
posted @ 2022-02-14 17:37 fervency 阅读(140) 评论(0) 推荐(0) 编辑