88pts最后三个点不过求助

#include<bits/stdc++.h>
using namespace std;
#define ll __int128
#define LL long long
const int N=4e7+5;
const int mod=(1<<30)-1;
int n,type,q[N],a,p[N],g[N],l[N],head=1,tail=1,r[N],b[N];
ll ans;
ll sum[N];

template<typename T>
void read(T &x) {
	x = 0; char c = getchar(); bool s = 0;
	for (; !isdigit(c); c = getchar()) s ^= (c == '-');
	for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
	if (s) x = -x;
}
template<typename T>
void write(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x > 9) write(x / 10);
	putchar(x % 10 + '0');
	return;
}

int main(){
	read(n);read(type);
	if(type){
		LL x,y,z,b1,b2,m;
		read(x);read(y);read(z);read(b1);read(b2);read(m);b[1]=b1;b[2]=b2;
		for(LL i=3;i<=n;i++)b[i]=((LL)b[i-1]*x+b[i-2]*y+z)%mod;
		for(LL i=1;i<=m;i++){
			read(p[i]);read(l[i]);read(r[i]);
			for(LL j=p[i-1]+1;j<=p[i];j++){
				a=((LL)b[j]%((LL)r[i]-l[i]+1))+l[i];
				sum[j]=sum[j-1]+a;
			}
		}
	}
	else{
		for(int i=1;i<=n;i++)read(a),sum[i]=sum[i-1]+a;
	}
	for(int i=1;i<=n;i++){
		while(head<tail&&(sum[q[head+1]]<<1)-sum[g[q[head+1]]]<=sum[i])head++;
		g[i]=q[head];
		while(head<=tail&&(sum[q[tail]]<<1)-sum[g[q[tail]]]>=(sum[i]<<1)-sum[g[i]])tail--;
		q[++tail]=i;
	}
	for(int p=n;p;p=g[p]){
		ll tmp=sum[p]-sum[g[p]];
		ans+=tmp*tmp;
	}
	write(ans);
	return 0;
}