Järjestys

#include <iostream>
#include <vector>
#include <algorithm>    // std::reverse
#include <queue>


using namespace std;

int main(int argc, char *argv[])
{
    int qty = 0;
    std::cin >> qty;
    std::vector<int> b(0,0);
    for(int i = 0; i < qty; i++){
        int z = 0;
        std::cin >> z;
        b.push_back(z);
    }

    queue<int> switches;

    int q = b.size();

    while(q > 1){

            int index = std::find(b.begin(), b.end(), q) - b.begin();
            switches.push(index+1);
            switches.push(q);

            std::reverse(b.begin(), b.begin()+index+1);

            /*

            for(int i = 0; i < b.size(); i++){
                std::cout << b[i] << " ";
            }
            std::cout << std::endl;*/

            std::reverse(b.begin(), b.begin()+q);

            q = q - 1;
/*
            for(int i = 0; i < b.size(); i++){
                std::cout << b[i] << " ";
            }
            std::cout << std::endl;
*/

    }



    std::cout << switches.size() << std::endl;

    while(switches.size() > 0){
        std::cout << switches.front() << std::endl;
        switches.pop();
    }

    return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED