70WA求调

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N(2e5+5),mod(92084931);
int n,m;
ll s[N],b[N],tr[N],a[N];
#define lowbit(x) (x&(-x))
inline void add(int x,int N){
    while(x<=N){
        tr[x]=(tr[x]+1)%mod;
        x+=lowbit(x);
    }
}
inline ll query(int x){
    ll res(0);
    while(x){
        res+=tr[x];res%=mod;
        x-=lowbit(x);
    }return res;
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin>>n>>m;
    for(int i(1);i<=n;++i){
        cin>>a[i];a[i]-=m;
        s[i]=s[i-1]+a[i];
        b[i]=s[i];
    }
    sort(b+1,b+n+1);int nl(unique(b+1,b+n+1)-b);
    for(int i(1);i<=n;++i) s[i]=lower_bound(b+1,b+nl+1,s[i])-b;
    ll ans(0);
    for(int i(1);i<=n;++i){
        // cout<<s[i]<<" "<<query(s[i]-1)<<"\n";
        add(s[i],nl);
        ans=(ans+query(s[i]-1)+(b[s[i]]>0))%mod;
    }cout<<ans;
    return 0;
}