#include<iostream>
#include<cstdio>const int N=5000005;
int n,q,a[N],b[N];
int main(){
cin>>n>>q;for(int i=1;i<=n;i++){
int l,r,x;
cin>>l>>r>>x;
a[l]+=x,a[r+1]-=x;//差分数组 }for(int i=;i<=n;i++){
b[i]=b[i-1]+a[i];
cout<<b[i]<<endl;//前缀和 b[i]=a[1]+a[2]+...a[i] }return0;}
二维数组的前缀和
b[i2][j2]-b[i1][j1-1]-b[i1-1][j2]+b[i1-22][j1-1]; i1 j1 左上角 i2 j2 右下角\
#include<bits/stdc++.h>
using namespace std;const int N=5005;
int a[N][N],b[N][N],n,q;
int main(){scanf("%d",&n);for(in i=1;i<=n;i++)for(int j=1;j<=n;j++)scanf("%d",&a[i][j]);for(int i=1;i<=n;i++)for(int j=1;j<=n;j++) b[i][j]=b[i][j-1]+a[i][j];for(int j=1;j<=n;j++)for(int i=1;i<=n;i++) b[i][j]=+=b[i-1][j];}
朴素法(没得用)
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int a[N],b[N],n;
int main(){
cin>>n;for(int i=1;i<=n;i+){
cin>>a[i];}for(int i=1;i<=n;i++){
b[i]=b[i-1]+a[i];}
cin>>q;for(int i=1;i<=q;i++){
int l,r;
cout<<b[r]-b[l-1];}return0;}