Järjestys

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


int main() {
	std::ios::sync_with_stdio(false);

	int N;
	std::cin >> N;
	std::vector<int> vec(N);
	std::vector<int> flips;

	for (int i = 0; i<N; ++i)
		std::cin >> vec[i];

	for(auto first = vec.begin(), last = vec.end(); first != last; --last)
	{
		auto mid = max_element(first, last);
		if (mid == last - 1) {
			continue;
		}
		if (first != mid) {
			flips.push_back(distance(first, mid + 1));
			reverse(first, mid + 1);
		}
		flips.push_back(distance(first, last));
		reverse(first, last);
	}

	std::cout << flips.size() << std::endl;
	for (auto flip : flips)
		std::cout << flip << " ";
	std::cout << std::endl;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED