5 solutions

  • 0
    @ 2025-7-26 10:51:24
    #include<bits/stdc++.h>
    using namespace std;
    int n,p,l=0,a[5000005],sum[5000005],x,y,z,ans=1e9;
    int main(){
    	cin>>n>>p;
    	for(int i=1;i<=n;i++) {
    		cin>>a[i];
    	}
    	for(int i=1;i<=p;i++) {
    		cin>>x>>y>>z;
    		sum[y]+=z;
    		sum[x-1]-=z;
    	}
    	for(int i=n;i>=1;i--) {
    		l+=sum[i];
    		a[i]+=l;
    		ans=min(ans,a[i]);
    	}
    	cout<<ans;
    	return 0;
    }
    
    
    • @ 2025-7-26 10:51:59
      #include<bits/stdc++.h>
      using namespace std;
      int n,p,l=0,a[5000005],sum[5000005],x,y,z,ans=1e9;
      int main(){
      	cin>>n>>p;
      	for(int i=1;i<=n;i++) {
      		cin>>a[i];
      	}
      	for(int i=1;i<=p;i++) {
      		cin>>x>>y>>z;
      		sum[y]+=z;
      		sum[x-1]-=z;
      	}
      	for(int i=n;i>=1;i--) {
      		l+=sum[i];
      		a[i]+=l;
      		ans=min(ans,a[i]);
      	}
      	cout<<ans;
      	return 0;
      }
      
      

Information

ID
6406
Time
1000ms
Memory
125MiB
Difficulty
3
Tags
# Submissions
104
Accepted
32
Uploaded By