Järjestys

#include <algorithm>
#include <iostream>
#include <iterator>
#include <vector>
#include <string>
#include <sstream>

using namespace std;
 
template <typename T, typename U>
vector<int> 
pancake_sort(T first, T last, U order)
{
	vector<int> prod;
	if (distance(first, last) < 2)
		return prod; 
 
	for (; first != last; --last) {
		T mid = max_element(first, last, order);
		if (mid == last - 1)
			continue;
		if (first != mid) {
			reverse(first, mid + 1);
			prod.push_back(distance(first, mid + 1));
		}
		reverse(first, last);
		prod.push_back(distance(first, last));
	}
	return prod;
}
 
template <typename T>
vector<int>
pancake_sort(T first, T last)
{
	return pancake_sort(first, last, less<typename iterator_traits<T>::value_type>());
}

int
main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	string buf, i;
	int j = 0;
	vector<int> fin;
	getline (cin, i);
	vector<int> Vec(100000);
	getline (cin, buf);
	istringstream ssin(buf);
        int input;
        while(ssin >> input) {
            Vec[j] = input;
	    j++;
        }
;
	fin = pancake_sort (Vec.begin(), Vec.end());
	cout << fin.size() << "\n";
	copy(fin.begin(), fin.end(), ostream_iterator<int>(cout, " "));
	cout << "\n";
	return 0;
}

Test 1

Group: 1

Verdict: TIME LIMIT EXCEEDED

Test 2

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED