虽然正解不是暴力，但是我还是想水一道题练习自己的卡常能力

#include<bits/stdc++.h>
#define re register
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
using namespace std;
inline int read()
{
	int x=0;char c=getchar();
	while(c<'0'||c>'9') c=getchar();
	while(c>='0'&&c<='9') {
		x=(x<<3)+(x<<1)+c-48;
		c=getchar();
	}
	return x;
}
int write(int n)
{
	if(n<0) putchar('-');
	if(n>9) write((n>>3)+(n>>1));
	putchar(n%10+'0');
}
int n,m,a[100050],l,r,x,q,ans=0;
int main()
{
	n=read();m=read();
	for(re int i=1;i<=n;++i) a[i]=read();
	for(re int i=1;i<=m;++i) {
		q=read();l=read();r=read();x=read();
		if(q==1) {
			for(re int j=l;j<=r;j+=8) {
				if(a[j]>x) a[j]-=x;
				if(a[j+1]>x&&j+1<=r) a[j+1]-=x;
				if(a[j+2]>x&&j+2<=r) a[j+2]-=x;
				if(a[j+3]>x&&j+3<=r) a[j+3]-=x;
				if(a[j+4]>x&&j+4<=r) a[j+4]-=x;
				if(a[j+5]>x&&j+5<=r) a[j+5]-=x;
				if(a[j+6]>x&&j+6<=r) a[j+6]-=x;
				if(a[j+7]>x&&j+7<=r) a[j+7]-=x;
			}
		}
		else if(q==2) {
			for(re int j=l;j<=r;j+=8) {
				if(a[j]==x) ans++;
				if(a[j+1]==x&&j+1<=r) ans++;
				if(a[j+2]==x&&j+2<=r) ans++;
				if(a[j+3]==x&&j+3<=r) ans++;
				if(a[j+4]==x&&j+4<=r) ans++;
				if(a[j+5]==x&&j+5<=r) ans++;
				if(a[j+6]==x&&j+6<=r) ans++;
				if(a[j+7]==x&&j+7<=r) ans++;
			}
			write(ans);
			putchar('\n');
			ans=0;
		}
	}
	return 0;
}