ARC 075E Meaningful Mean 枚举+树状数组

点击打开链接

题意:n个数,问有多少个区间[l,r]平均数>=k,即满足 a[l]+a[l+1]..+a[r] >= k*(r-l+1) .n<=1e5,k,a[i]<=1e9

p[i]为前缀和i,若区间[l,r-1]满足,p[r-1]-p[l-1]>=k*r-k*l , p[r-1]-k*r >=p[l-1]-k*l

枚举r(开区间),离散化后,利用树状数组求出,前缀r-1中有多少个l(l<r)满足 p[r-1]-k*r>=p[l-1]-k*l即可 O(nlogn) 

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+20;
const int maxn=2e5;
ll n,k,a[N],p[N];
ll c[N];
vector<ll> v,t;
ll getid(ll x)
{
	return lower_bound(v.begin(),v.end(),x)-v.begin()+1;	
} 
ll lowbit(ll x){return x&-x;}
void update(ll x,ll p)
{
	for(int i=x;i<=maxn;i+=lowbit(i))
		c[i]+=p;
}
ll sum(ll x)
{
	ll res=0;
	for(int i=x;i>0;i-=lowbit(i))
		res+=c[i];
	return res;
}
int main()
{
	while(cin>>n>>k)
	{
		v.clear();
		memset(c,0,sizeof(c));
		memset(p,0,sizeof(p));
		for(int i=1;i<=n;i++)
		{
			scanf("%I64d",&p[i]);
			p[i]=p[i]+p[i-1]-k;
			v.push_back(p[i]);
		}
		sort(v.begin(),v.end());
		v.erase(unique(v.begin(),v.end()),v.end());
		ll ans=0;
		for(int i=0;i<=n;i++)
		{
			//cout<<p[i]<<' ';
			p[i]=getid(p[i]);
			ans+=sum(p[i]);
			update(p[i],1);
			//cout<<p[i]<<endl;
		}
		cout<<ans<<endl;

	}
	return 0;
}