洛谷 P3948 数据结构(差分数组)

#include <bits/stdc++.h>
#define ll long long
#define maxn 80005
using namespace std;
int n,m,mod,Min,Max;
ll a[maxn], pre[maxn];
string str;

int main()
{
	scanf("%d%d%d%d%d",&n,&m,&mod,&Min,&Max);
	int xx, yy, zz;
	while(m--){
		cin>>str;
		if(str == "A"){
			scanf("%d%d%d",&xx,&yy,&zz);
			a[xx] += zz;
			a[yy + 1] -= zz;
		}
		else{
			scanf("%d%d",&xx,&yy);
			ll sum = 0;
			int cnt = 0;
			for(int i=1;i<=yy;i++){
				sum += a[i];
				if(i >= xx && Min <= sum * i % mod && sum * i % mod <= Max)cnt ++;
			}
			printf("%d\n",cnt);
		}
	}
	ll sum = 0;
	for(int i=1;i<=n;i++){
		sum += a[i];
		pre[i] += pre[i-1];
		if(Min <= sum * i % mod && sum * i % mod <= Max) pre[i] ++;
	}
	int t;
	scanf("%d",&t);
	while(t--){
		int l, r;
		scanf("%d%d",&l, &r);
		printf("%lld\n", pre[r] - pre[l - 1]);
	}
	return 0;
}