Kyselyt

#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;

template <typename T>
int ops(T l, T r) {
	if (l == r) return 0;
	auto m = max_element(l, r);
	int cnt = 0;
	for (auto it = m; it < r; ++it) {
		cnt += *m - *it;
	}
	return cnt + ops(l, m);
}

int main()
{
	int n, q;
	cin >> n >> q;
	vector<int> v(n);
	for (int i = 0; i < n; ++i) {
		cin >> v[i];
	}
	for (int i = 0; i < q; ++i) {
		int a, b;
		cin >> a >> b;
		cout << ops(v.begin() + a - 1, v.begin() + b) << endl;
	}
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 4

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 5

Group: 3

Verdict: TIME LIMIT EXCEEDED