제출 #1152537

#제출 시각아이디문제언어결과실행 시간메모리
1152537WongYiKaiSjeckanje (COCI21_sjeckanje)C++20
0 / 110
0 ms320 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ll n,q; cin >> n >> q; ll a[n+5]; for (int i=1;i<=n;i++){ cin >> a[i]; } while (q--){ ll l,r,x; cin >> l >> r >> x; for (int i=l;i<=r;i++){ a[i] += x; } ll ans=0; for (int i=2;i<n;i++){ if (a[i-1]<a[i]&&a[i+1]<=a[i]){ ans += a[i]; ans += max(a[i-1],a[i+1]); } else if (a[i-1]>=a[i]&&a[i+1]>a[i]){ ans -= a[i]; ans -= min(a[i-1],a[i+1]); } } if (a[2]>a[1]){ ans -= a[1]; } else{ ans += a[1]; } if (a[n-1]>=a[n]){ ans -= a[n]; } else{ ans += a[n]; } cout << ans << "\n"; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...