有个人为了节省内存已经疯了（

#include <iostream>
#include <cstdio>
using namespace std;
int past, now;//双龙戏珠（ 
int b[5000005];
int l, r, k; 
int read(){
	char c = getchar();
	int x = 0, f = 1;
	while(!isdigit(c)){
        if(c == '-') f = -1;
        c = getchar();
    }
	while(isdigit(c)){
		x = (x << 3) + (x << 1) + c - '0';
		c = getchar();
	}return x * f;
}
int main(){
	int n = read(), t = read();
	for(int i = 1; i <= n; i++){
		now = read();
		b[i] = now - past;
		past = now;
	}while(t--){
		l = read(), r = read(), k = read();
		b[l] += k, b[r + 1] -= k;
	}int ct = 0, mx = 1e9 + 7;
	for(int i = 1; i <= n; i++){
		ct += b[i];
		mx = min(mx, ct);
	}cout << mx;

	return 0;
}