Järjestys

#include <iostream>
#include <string>
#include <math.h>
#include <vector>


#define max(a,b) (a > b ? a : b)

int main()
{
	int count;
	std::cin >> count;
	int* numbers = new int[count+1];
	int* numbers_indices = new int[count + 1]; 
	int* numbers_indices_f = new int[count + 1];
	int* klist = new int[count*4];
	int klist_top = 0;
	for(int i = 1;i <= count;i++)
	{
		std::cin >> numbers[i];
		//numbers[i] = count - i + 1;
		numbers_indices[numbers[i]] = i;
		numbers_indices_f[numbers[i]] = 0;
		
	}
	
	for(int i = 1;i <= count;i++)
	{
		for(int o = i-1;o > 0;o--)
		{
			if(numbers[o] > numbers[i])
			{
				numbers_indices_f[numbers[i]] ++;
				if(numbers[o] == numbers[i] + 1)
				{
					numbers_indices_f[numbers[i]] += numbers_indices_f[numbers[o]];
					break;
				}
			}
			
		}
	}
	
	for(int n = count;n >= 1;n--) //<=2n siirtoa ratkaisuun
	{
		/*if(n == count)
		{
			klist[klist_top] = (numbers_indices[n]);
			klist_top++;
		}
		else                    
		{
			int fa_index = numbers_indices[n];
			klist[klist_top] = fa_index;
			klist_top++;

		}*/
		klist[klist_top] = numbers_indices[n]-numbers_indices_f[n];
		klist_top++;
		klist[klist_top] = n;
		klist_top++;
		klist[klist_top] = max(n-1,1);
		klist_top++;
		klist[klist_top] = max((numbers_indices[n]-numbers_indices_f[n])-1,1);
		klist_top++;

		


		/*for(int i = 1;i < n;i++)        
		{
			
			if(numbers_indices[i] <= numbers_indices[n])
			{
				numbers_indices[i] = numbers_indices[n] - numbers_indices[i] + 1;
			}
			numbers_indices[i] = n - numbers_indices[i] + 1;
		}*/

	}
	std::cout << klist_top << '\n';
	//std::cout << "proc_counter = " << proc_counter << ",time: " << timeGetTime() - t << "ms";
	for(int i = 0;i < klist_top;i++)
	{
		std::cout << klist[i] << ' ';
	}
	/*std::cin.clear();
	std::cin.sync();
	std::cin.get();*/
	return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED