Järjestys

//#include "stdafx.h"
#include <iostream>
using namespace std;
 
int a[100001];
int n = 0;
int m = 0;
int k[200000];
void f(int e);
 
int main()
{
	cin >> n;
	int d = 0;
	for (int i = 0; i < n; i++) {
		cin >> d;
		a[d] = i;
	}
	for (int i = n; i > 0; i--) {
		if (a[i] + 1 != i) {
			k[m] = a[i] + 1;
			m++;
			f(a[i] + 1);
			k[m] = i;
			m++;
			f(i);
		}
		n--;
	}
	printf("%i\n", m);
	for (int i = 0; i < m; i++) {
		printf("%i ",k[i]);
	}
	//cin >> n;
	return 0;
}
 
void f(int e) {
	for (int i = 1; i <= n; i++) {
		if (a[i]<e) {
			a[i] = e - a[i] - 1;
		}
	}
	return;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED