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);
    }

    int q = b.size();

    std::cout << (b.size() - 1)*2 << std::endl;

    while(q > 1){

            int index = std::find(b.begin(), b.end(), q) - b.begin();
            std::cout << index + 1 << std::endl << q << std::endl;

            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);

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

    }

    return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED