1148C - Crazy Diamond

D - Crazy Diamond
链接: link.
题意：给一个1–n（n是偶数）的随机排列,每次可以交换i,j元素（|i-j|*2>=n），
求怎样交换可使序列升序。
思路:
1)i=a[i]该位置已经排好序
2)|i-a[i]|*2>=n,可直接交换
3)|i-a[i]|*2<n,分情况，具体请看毒瘤代码。

#define ll long long
#define PII pair<int,int>
using namespace std;
int n,a[300010];
vector<PII>v;
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin>>n;
    for(int i=1;i<=n;i++)cin>>a[i];
    PII x;
    for(int i=1;i<=n;i++)
    {
        if(a[i]==i)continue;
        if(abs(i-a[i])>=n/2)
        {
            x.first=i;x.second=a[i];
            v.push_back(x);
            swap(a[i],a[a[i]]);
            i--;
            continue;
        }
        if(i<=n/2)
        {
            if(a[i]<=n/2)
            {
                x.first=i;x.second=n;
                v.push_back(x);
                swap(a[i],a[n]);
                x.first=n;x.second=a[n];
                v.push_back(x);
                swap(a[n],a[a[n]]);
                x.first=i;x.second=n;
                v.push_back(x);
                swap(a[i],a[n]);
                i--;
            }
            else
            {
                x.first=i;x.second=n;
                v.push_back(x);
                swap(a[i],a[n]);
                x.first=n;x.second=1;
                v.push_back(x);
                swap(a[n],a[1]);
                x.first=1;x.second=a[1];
                v.push_back(x);
                swap(a[1],a[a[1]]);
                x.first=n;x.second=1;
                v.push_back(x);
                swap(a[n],a[1]);
                x.first=n;x.second=i;
                v.push_back(x);
                swap(a[n],a[i]);
                i--;
            }
        }
        else
        {
            if(a[i]<=n/2)
            {
                x.first=i;x.second=1;
                v.push_back(x);
                swap(a[i],a[n]);
                x.first=n;x.second=1;
                v.push_back(x);
                swap(a[n],a[1]);
                x.first=n;x.second=a[n];
                v.push_back(x);
                swap(a[n],a[a[n]]);
                x.first=n;x.second=1;
                v.push_back(x);
                swap(a[n],a[1]);
                x.first=1;x.second=i;
                v.push_back(x);
                swap(a[1],a[i]);
                i--;
            }
            else
            {
                x.first=i;x.second=1;
                v.push_back(x);
                swap(a[i],a[1]);
                x.first=1;x.second=a[1];
                v.push_back(x);
                swap(a[1],a[a[1]]);
                x.first=i;x.second=1;
                v.push_back(x);
                swap(a[i],a[1]);
                i--;
            }
        }
    }
    cout<<v.size()<<"\n";
    for(int i=0;i<v.size();i++)
    {
        cout<<v[i].first<<" "<<v[i].second<<"\n";
    }
    return 0;
}