#include <bits/stdc++.h>
using namespace std;
#define FOR0(a,b) for(int i = a; i < b; ++i)
#define FORE(a,b) for(int i = a; i <= b; ++i)
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 3e5+5;
int n,m,tot;
ll a[maxn];
ll pre[maxn];
ll c[maxn];
int f(ll x) {
return int(lower_bound(pre
树状数组找出[1,r]中比x小的数的个数
最新推荐文章于 2021-07-12 10:21:46 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)