备战 "蓝桥杯"(前缀和差篇) - AcWing 797.
最编程
2024-03-25 11:48:05
...
模板题,先对区间进行
m
m
m次加减,然后再输出操作后的序列
AC代码:
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define endl "\n";
int a[200100],b[200100];
void solve(){
int n,m,l,r,w;
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>a[i];
}
while(m--){
cin>>l>>r>>w;
b[l]+=w;
b[r+1]-=w;
}
for(int i=1;i<=n;i++){
b[i]+=b[i-1];
cout<<a[i]+b[i]<<" ";
}
cout<<endl;
return ;
}
signed main()
{
IOS
int t=1;
//cin>>t;
while(t--)
solve();
return 0;
}