题解 100% AC

#include <bits/stdc++.h>
using namespace std;
int a[1000010],d[1000010];
int main(){
    int m,n;cin>>n>>m;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        d[i]=a[i]-a[i-1];
    }
    for(int i=1;i<=m;i++){
        int l,r,c;cin>>l>>r>>c;
        d[l]+=c,d[r+1]-=c;
    }
    int minn=2147483647;
    for(int i=1;i<=n;i++){
        a[i]=a[i-1]+d[i];
        minn=min(a[i],minn);
    }
    cout<<minn;
    return 0;
}