题目描述
题解
将每个数减去k之后求前缀和。求前缀和数组的逆序对即可。
代码
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
#define LL long long
#define N 100005
int n,k;LL rev;
int a[N],s[N],b[N];
void mergesort(int l,int r)
{
int mid=(l+r)>>1;
if (l==r) return;
mergesort(l,mid);
mergesort(mid+1,r);
int i=l,j=mid+1,now=l;
while (i<=mid&&j<=r)
{
if (s[i]<s[j]) b[now++]=s[i++];
else b[now++]=s[j++],rev+=(LL)mid-i+1;
}
while (i<=mid) b[now++]=s[i++];
while (j<=r) b[now++]=s[j++];
for (;l<=r;++l) s[l]=b[l];
}
int main()
{
scanf("%d%d",&n,&k);
for (int i=1;i<=n;++i) scanf("%d",&a[i]);
for (int i=1;i<=n;++i)
{
s[i]=s[i-1]+a[i]-k;
if (s[i]<=0) ++rev;
}
mergesort(1,n);
printf("%lld\n",(LL)(n+1)*n/2-rev);
}