Järjestys

#include <iostream>
using namespace std;
int main() {
    int n;
    cin>>n;
    int x;
    int k;
    cout<<5*n-5;
	cout<<endl;
	int p[n];
	int j[n];
    for(int a=1; a<=n; a+=1){
        cin>>x;
        p[x]=a;
        j[a]=x;
    }
    for(int b=0; b<n-1; b+=1){
        if(b%2==1){
            k=n-b+1-p[n-b];
           cout<< k<<" " <<n-b<<" " <<n-b-1<<" " <<max(1, k-2)<<" " <<n-b-1<<" ";
            p[j[n-b]]=p[n-b];
            j[p[n-b]]=j[n-b];
        }
        else{
            k=p[n-b];
		if (k==n-b){
		cout<< k<<" "<<k<<" "<<k<<" "<<k<<" "<<k-1<<" ";}
else{
            cout<< max(1,k-1)<<" " <<n-b-1<<" " <<n-b<<" " << k+1<<" " <<n-b<<" ";}
            p[j[n-b]]=p[n-b];
            j[p[n-b]]=j[n-b];
        }
    }
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: ACCEPTED