oj.uz

Submission #814644

# Submission time Handle Problem Language Result Execution time Memory
814644 2023-08-08T08:43:59 Z shoryu386 Sjeckanje (COCI21_sjeckanje) C++17
0 / 110
 1 ms 212 KB 
#include <iostream>
using namespace std;
#define int long long
signed main(){
	int n, q; cin >> n >> q;
	
	int arr[n];
	for (int x = 0; x < n; x++) cin >> arr[x];
	
	int a,b,c;
	for (int k = 0; k < q; k++){
		cin >> a >> b >> c; a--; b--;
		
		for (int x = a; x <= b; x++) arr[x] += c;
		
		int sfmin = arr[0], sfmax = arr[0], ans = 0;
		for (int x = 0; x < n; x++){
			sfmin = min(sfmin, arr[x]);
			sfmax = max(sfmax, arr[x]);
			
			
			if (x != 0 && (arr[x-1] <= arr[x]) != (arr[x] <= arr[x+1])) ans += sfmax - sfmin, sfmin = arr[x+1], sfmax = arr[x+1];
		}
		ans += sfmax - sfmin;
		cout << ans << '\n';
	}
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 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 212 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 212 KB Output isn't correct
2 Halted 0 ms 0 KB -