Järjestys

#include <iostream>
 
int revCount = 0;
 
void reverse(int numbers[], int i)
{
    int temp, start = 0;
    while (start < i)
    {
        temp = numbers[start];
        numbers[start] = numbers[i];
        numbers[i] = temp;
        start++;
        i--;
    }
}
 
int findMax(int numbers[], int n)
{
	int nMax, i;
	for (nMax = 0, i = 0; i < n; ++i)
	{
		if (numbers[i] > numbers[nMax])
		{
			nMax = i;
		}
	}
   return nMax;
}
void Sort(int *numbers, int *reverses, int n)
{
 
    for (int size = n; size > 1; --size)
    {
        int nMax = findMax(numbers, size);
 
        if (nMax != size-1)
        {
			if (nMax > 0)
			{
				reverse(numbers, nMax);
				reverses[revCount] = nMax + 1;
				revCount++;
			}
			if (size > 1)
			{
 
				reverse(numbers, size-1);
				reverses[revCount] = size;
				revCount++;	
			}
 
        }
    }
}
 
int main()
{
	std::ios_base::sync_with_stdio(0);
	int n;
	std::cin >> n;
	int* numbers = new int[n];
	int* reverses = new int[2 * n];
	int x;
	for (int i = 0; i < n; i++)
	{
		std::cin >> x;
		numbers[i] = x;
	}
 
	Sort(numbers, reverses, n);
 
	std::cout << revCount << '\n';
	for (int i = 0; i < revCount; ++i)
	{
		printf("%d ", reverses[i]);
	}
 
	delete[] reverses;
	delete[] numbers;
    return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED