1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
| #include <bits/stdc++.h>
using namespace std;
const int maxn = 5e6 + 50;
int n, p, a[maxn], b[maxn];
int main() {
int x, y, z, cur = 0, ans = 0x3f3f3f3f;
cin >> n >> p;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
b[i] = a[i] - a[i - 1];
}
while (p--) {
cin >> x >> y >> z;
b[x] += z, b[y + 1] -= z;
}
for (int i = 1; i <= n; ++i) {
cur += b[i];
ans = min(ans, cur);
}
cout << ans;
return 0;
}
|
