ARC075 E.Meaningful Mean（树状数组）

题目大意：给定n和k，问an中有多少子区间的平均值大于等于k

很巧妙的一个式子，就是如果一个区间[l, r]满足条件

那么则有

sum[r] - sum[l-1] >= (r-l+1)*k

整理一下就是sum[r] - r*k >= sum[l-1] - (l-1)*k

然后先离散一下，用树状数组就可以了

#include <algorithm>
#include <iostream>
#include <vector>
#include <cstdio>
#include <map>
using namespace std;
typedef long long LL;
const int maxn = 2e5 + ;
int n, k;
LL a[maxn], c[maxn*];
map<LL, int> M;
vector<LL> V;
void Modify(int x, int s){
    for(; x <= n; x += x&(-x)) c[x] += s;
}
LL Query(int y){
    if(y <= ) return ;
    LL ans = ;
    for(int x = y; x; x -= x&(-x)) ans += c[x];
    return ans;
}

int main()
{
    int x;
    scanf("%d %d", &n, &k);
    for(int i = ; i <= n; i++) scanf("%d", &x), a[i] = x;
    LL sum = ;
    for(int i = ; i <= n; i++) {
        sum += a[i];
        sum -= k;
        V.push_back(sum);
    }
    sort(V.begin(), V.end());
    for(int i = ; i < V.size(); i++) M[V[i]] = i+;
    sum = ;
    LL ans = ;
    for(int i = ; i <= n; i++){
        sum += a[i];
        sum -= k;
        ans += Query(M[sum]);
        if(sum >= ) ans++;
        Modify(M[sum], );
    }
    cout<<ans<<endl;
}