随笔分类 -  树状数组

树状数组【单点修改+区间查询】+二分
摘要:https://codeforces.com/gym/580226/problem/H #include<bits/stdc++.h> using namespace std; #define endl '\n' #define lowbit(x) x&(-x) using ll = long lo 阅读全文
posted @ 2025-01-13 10:50 laileou 阅读(2) 评论(0) 推荐(0) 编辑
树状数组【区间修改+单点查询】
摘要:https://www.luogu.com.cn/problem/P3368 #include<bits/stdc++.h> using namespace std; #define endl '\n' #define lowbit(x) x&(-x) using ll = long long; u 阅读全文
posted @ 2025-01-13 09:41 laileou 阅读(3) 评论(0) 推荐(0) 编辑
树状数组【单点修改+区间查询】
摘要:https://www.luogu.com.cn/problem/P3374 #include<bits/stdc++.h> using namespace std; #define endl '\n' #define lowbit(x) x&(-x) using ll = long long; u 阅读全文
posted @ 2025-01-13 09:14 laileou 阅读(3) 评论(0) 推荐(0) 编辑

 
点击右上角即可分享
微信分享提示