Järjestys

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

int main() {

    int n;
    std::cin >> n;
    
    int str[n];
    std::vector<int> moves;

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

    bool fin = false;
    int rep = 0;
    while(!fin) {
        int s = str[0];
        int to = 0;

        if(s == n) to = n;
        
        else if(str[1] == s + 1) {
            int prev = 0;
            for(int i = 0; i < n; i++) {
                if(prev < str[i]) {
                    prev = str[i];    
                } else {
                    to = i;
                    break;    
                }

                if(i == n - 1) fin = true;
            }
        } else {
            for(int i = 2; i < n; i++) {
                if(str[i] == s + 1) {
                    to = i;
                    break;    
                }
            }
        }

        std::reverse(str, str + to);
        if(to != 0) moves.push_back(to);

        if(rep++ > 50) break;
    }

    std::cout << moves.size() << "\n";

    for(unsigned int c = 0; c < moves.size(); c++ /* heh */)
        std::cout << moves[c] << " ";
    std::cout << "\n";

    return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: WRONG ANSWER