oj.uz

Submission #849806

# Submission time Handle Problem Language Result Execution time Memory
849806 2023-09-15T11:56:25 Z gun_gan Sjeckanje (COCI21_sjeckanje) C++17
0 / 110
 1 ms 348 KB 
#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 lo = A[1], hi = A[1], res = 0;
      for(int x = 2; x <= N; x++) {
            if(lo <= A[x] && A[x] <= hi) {
                  res += hi - lo;
                  lo = A[x], hi = A[x];
                  continue;
            }
            lo = min(lo, A[x]);
            hi = max(hi, A[x]);
      }
      res += hi - lo;
      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';
      }
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 55.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -