- 修正成绩
题解
- @ 2026-5-30 15:00:47
#include <bits/stdc++.h> using namespace std;
int main() { int n, p; cin >> n >> p;
int a[100005] = {0};
int d[100005] = {0};
for(int i=1; i<=n; i++){
cin >> a[i];
}
while(p--){
int x, y, z;
cin >> x >> y >> z;
if(x > y) swap(x, y);
d[x] += z;
d[y+1] -= z;
}
int min_ans = 1e9;
int add = 0;
for(int i=1; i<=n; i++){
add += d[i];
min_ans = min(min_ans, a[i] + add);
}
cout << min_ans;
}
2 条评论
-
aiyike LV 9 @ 2026-10-24 19:09:27gggggugugaga
咕咕嘎嘎 -
@ 2026-9-26 19:58:13zdjd?
- 1
信息
- ID
- 533
- 时间
- ms
- 内存
- MiB
- 难度
- 4
- 标签
- 递交数
- 130
- 已通过
- 21
- 上传者