第十九届同济大学程序设计竞赛暨高校网络友谊赛 G-归零（可持久化权值线段树）

简单分析可得，小于k/2的数，减为0，大于k/2+1的数，加至k。
所以问题转为求小于区间小于等于k/2的数的和+区间大于k/2+1的数的个数*k-
区间大于k/2+1的数的负数的和。
不使用build则无需离散化。

// Problem: 归零
// Contest: NowCoder
// URL: https://ac.nowcoder.com/acm/contest/34442/G
// Memory Limit: 524288 MB
// Time Limit: 4000 ms

#include<bits/stdc++.h>
using namespace std;
#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef vector<int> VI;
inline ll qmi(int a, int b, int p){ ll res = 1 % p; while (b){ if (b & 1) res = res * a % p; a = a * (ll)a % p; b >>= 1;} return res;}
inline ll qm(ll a, ll b){ ll res = 1 ; while (b){ if (b & 1) res = res * a ; a = a * (ll)a ; b >>= 1;} return res;}
inline ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
inline ll lcm(ll x, ll y) { return x / gcd(x, y) * y;}
inline ll maxll(ll x, ll y) { return x > y ? x : y; }
inline ll minll(ll x, ll y) { return x < y ? x : y; }
const int mod=1000000007 , N = 2e5 + 10;
int a[N];
int n,m;
int root[N],idx;
struct node
{
	int l,r;
	ll sum,cnt;
}tr[N*40];
vector<int> num;
int find(int x)
{
	return lower_bound(num.begin() , num.end() , x) - num.begin();
}
int build(int l,int r)
{
	int u = ++idx;
	if(l == r)
	{
		return u;
	}
	int mid = l + r >> 1;
	tr[u].l = build(l,mid) , tr[u].r = build(mid+1,r);
	return u;
}
void insert(int &p,int u,int l,int r,int x)
{
	p = ++idx;
	tr[p] = tr[u];
	tr[p].cnt ++;
	tr[p].sum += x;
	if(l == r)
	{	
		return ;
	}
	int mid = l + r >> 1;
	if(x <= mid)	 insert(tr[p].l,tr[u].l,l,mid,x);
	else insert(tr[p].r,tr[u].r,mid+1,r,x);
	return ;
}
ll query1(int p,int q,int l,int r,int lk,int rk)
{
	if(l >= lk && r <= rk)	return tr[p].sum - tr[q].sum;
	int mid = l + r >> 1;
	ll sum = 0;
	if(lk <= mid)	sum += query1(tr[p].l,tr[q].l,l,mid,lk,rk);
	if(rk > mid)	sum += query1(tr[p].r,tr[q].r,mid+1,r,lk,rk);
	return sum;
}
ll query2(int p,int q,int l,int r,int lk,int rk,int k)
{
	if(l >= lk && r <= rk)
	{
		return (ll)(tr[p].cnt - tr[q].cnt)*k - (tr[p].sum - tr[q].sum);
	}
	int mid = l + r >> 1;
	ll sum = 0;
	if(lk <= mid)	sum += query2(tr[p].l,tr[q].l,l,mid,lk,rk,k);
	if(rk > mid)	sum += query2(tr[p].r,tr[q].r,mid+1,r,lk,rk,k);
	return sum;
}
void solve()
{
	cin>>n>>m;
	for(int i = 1 ; i <= n ; i ++ )	cin>>a[i],num.push_back(a[i]);
	int len = 1e9;
	for(int i = 1 ; i <= n ; i ++ )
		insert(root[i],root[i-1],0,len,a[i]);
	while(m -- )
	{
		int l,r,k;
		cin>>l>>r>>k;
		ll ans = 0;
		ans += query1(root[r],root[l-1],0,len,0,k/2);
		ans += query2(root[r],root[l-1],0,len,k/2+1,k,k);
		cout<<ans<<"\n";
	}
}
int main(){
	// int t;
	// cin>>t;
	// while(t--)
	// {
		solve();
	// }
	return 0;
}