C++代码

#include<bits/stdc++.h>
using namespace std;
int n,a[10000],t,d[10000];
int main(){
    cin>>n>>t;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		if(i==1) d[i]=a[i];
		else d[i]=a[i]-a[i-1];
	}
	while(t--){
		int x,y,v;
		cin>>x>>y>>v;
		d[x]+=v;
		d[y+1]-=v;
	}
	for(int i=1;i<=n;i++){
		a[i]=a[i-1]+d[i];
	}
	for(int i=1;i<=n;i++){
		cout<<a[i]<<" ";
	}
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int n,a[10000],t,d[10000],ma=-1;
int main(){
    cin>>n>>t;
	while(t--){
		int v,f,to;
		cin>>v>>f>>to;
		d[f]+=v;
		d[to-1]-=v;
		ma=max(ma,to);
	}
	bool b=true;
	for(int i=1;i<=n;i++){
		a[i]=a[i-1]+d[i];
		if(a[i]>n) b=false;break;
	}
	if(b==true) cout<<"true";
	else cout<<"false";
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int n,a[10000],t,d[10000],ma=-1;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		int x,y;
		cin>>x>>y;
		d[x]++;
		d[y-1]--;
	}
	for(int i=1;i<=n;i++){
		a[i]=a[i-1]+d[i];
		ma=max(ma,a[i]);
	}
	cout<<ma;
	return 0;
}