Submission #849808

#TimeUsernameProblemLanguageResultExecution timeMemory
849808gun_ganSjeckanje (COCI21_sjeckanje)C++17
0 / 110
1 ms344 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int MX = 2e5 + 5; int N, Q; ll A[MX]; ll calc() { ll res = 0; for(int x = 1; x + 1 <= N; x++) { if(A[x] == A[x + 1]) continue; if(A[x] < A[x + 1]) { int y = x; while(y + 1 <= N && A[y] < A[y + 1]) y++; res += A[y] - A[x]; x = y; } else { int y = x; while(y + 1 <= N && A[y] > A[y + 1]) y++; res += A[x] - A[y]; x = y; } } return res; } int main() { cin.tie(0); ios_base::sync_with_stdio(0); cin >> N >> Q; for(int i = 1; i <= N; i++) cin >> A[i]; for(int i = 1; i <= Q; i++) { ll l, r, x; cin >> l >> r >> x; for(int j = l; j <= r; j++) A[j] += x; cout << calc() << '\n'; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...