优化算法
这个代码去掉了a这个数组,因为我们根据b的递推式发现其实不用把每一个a都存下,只要记住上一个a就可以了
C++ 代码
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <vector>
using namespace std;
const int N = 100010;
int b[N];
int main() {
int n, m;
cin >> n >> m;
int t=0;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
b[i] = x - t;
t = x;
}
for (int i = 1; i <= m; i++) {
int begin,end,x;
cin >> begin >> end >> x;
b[begin] += x;
b[end + 1] -= x;
}
t = 0;
for (int i = 1; i <= n; i++) {
t += b[i];
cout << t << " ";
}
}