[abc] AtCoder Regular Contest 075 E Meaningful Mean 树状数组

前言

传送门 :

思路

我们令所有的$a[i]-k$

那么我们要求的就是 是否有一段前缀和$>=0$

经典的二维数点问题我们使用树状数组进行操作

Mycode

// Problem: E - Meaningful Mean
// Contest: AtCoder - AtCoder Regular Contest 075
// URL: https://atcoder.jp/contests/arc075/tasks/arc075_c
// Memory Limit: 256 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)

//��һ�δ��Ϻ�վ֮�� ��Ϊʹ��#define int long long TLE���¿��˺ܾõ�ʱ�� ���˼���ģ��
//����ʹ�ø��ӵ�ģ��


#include <bits/stdc++.h>
using namespace std;
#define IOS  ios::sync_with_stdio(false);
#define CIT  cin.tie(0);
#define COT  cout.tie(0);

#define int long long
#define ll long long
#define x first
#define y second
#define pb push_back
#define endl '\n'
#define all(x) (x).begin(),x.end()
#define Fup(i,a,b) for(int i=a;i<=b;i++)
#define Fde(i,a,b) for(int i=a;i>=b;i--)

typedef priority_queue<int,vector<int>,greater<int>>  Pri_m;
typedef pair<int,int> pii;
typedef vector<int> VI;
map<int,int> mp;

const int N  = 2e5+10;
int tot,n,k;

int tr[N],a[N],b[N];


int lowbit(int x){
	return x&-x;
}
void add(int x){
	for(int i=x;i<=tot;i+=lowbit(i)){
		tr[i]++;
	}
}

int query(int x){
	int sum = 0 ;
	for(int i=x;i;i-=lowbit(i)){
		sum+=tr[i];
	}
	return sum;
}
void solve()
{
	cin>>n>>k;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		a[i] -=k;
	}

	for(int i=1;i<=n;i++){
		a[i] = a[i] + a[i-1];

	}

	for(int i=1;i<=n;i++)
	b[i] = a[i];

	b[n+1] = 0 ; //因为需要计算 b[r] ~ b[0]的贡献

	sort(b+1,b+n+2);
	tot = unique(b+1,b+n+2) - (b+1);

	int  ans =0 ;

	
	for(int i = 0;i<=n;i++){
		int t = lower_bound(b+1,b+1+tot,a[i]) - b;
		ans+= query(t);
		add(t);
	}

	cout<<ans<<endl;



}
/**mYHeart is my algorithm**/
/**�㷨��˼ά�ij���**/
/**WA�˾�˵���Լ���˼ά�д�����**/
/**�ٱ�Թ������,�ද��**/
signed main()
{
    //int t;cin>>t;while(t -- )
    solve();
    return 0;
}