80分，最后一个点死活WA，必回关

#include<bits/stdc++.h>
using namespace std;
int n,p;
long long a[1000005],diff[1000005];
int main(){
	cin>>n>>p;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		diff[i]=a[i]-a[i-1];
	}
	for(int i=1;i<=p;i++){
		int x,y,z;
		cin>>x>>y>>z;
		diff[x]+=z;
		diff[y+1]-=z;
	}
	for(int i=1;i<=n;i++){
		a[i]=a[i-1]+diff[i];
	}
	sort(a+1,a+n+1);
	cout<<a[1];
	return 0;
}