#include<iostream> #include<algorithm> using namespace std; const int maxn = 100001; int A[maxn],d[maxn]; int main(void) { int n,m; cin >> n >> m; for(int i=1;i<=m;i++) { int L,R,C; cin >> L >> R >> C; d[L]+=C; d[R+1]-=C; } for(int i=1;i<=n;i++) { if(i==1) { A[i]=d[i]; cout << A[i]; } else { A[i]=A[i-1]+d[i]; cout << A[i]; } if(i!=n) cout << " "; } return 0; }
0.0分
0 人评分