Järjestys

input/code.cpp: In function 'bool isOrdered(std::vector<int>)':
input/code.cpp:10:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < toTest.size(); i++){
                                    ^
input/code.cpp: In function 'int main(int, char**)':
input/code.cpp:66:38: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < switches.size(); i++){
                                      ^

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


using namespace std;

bool isOrdered(std::vector<int> toTest){
    int prev = -1;
    for(int i = 0; i < toTest.size(); i++){
        if(toTest[i] < prev){
            return false;
        }
        prev = toTest[i];

    }
    return true;
}

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

    std::vector<int> switches(0,0);

    int q = b.size();

    while(!isOrdered(b)){

            int index = 0;
            while(b[index] != q){
                index = index + 1;
            }

            std::reverse(b.begin(), b.begin()+index+1);
            switches.push_back(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);
            switches.push_back(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;

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

    return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED