题目链接
链接: 选择交换
题目描述
解题思路
排序后则满足条件,如果不满足a1+an=a2+an-1…则直接输出NO
否则找出交换的l,r
需要注意的是下面这两段代码
for (int i = 1; i <= n; i++) A[B[i].second].second = i;
这段代码是让A的second存储他需要交换到的地方
for (int i = 1; i <= n; i++) while(A[i].second != i) result.push_back({i,A[i].second}), swap(A[i], A[A[i].second]);
这段代码是直到A找到自己要交换的位置 再找下一个位置 并把交换下标放到结果中
为什么是while呢,因为当前交换可能会因为前面的交换导致不能一次就交换到想要交换到的位置
代码实现
#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
typedef pair<int, int> PII;
const int N = 2e5 + 10;
PII A[N], B[N];
int sum;
void solve()
{
int n;
vector<PII> result;
cin >> n;
for (int i = 1; i <= n; i++) cin >> A[i].first, A[i].second = i, B[i] = A[i];
sort(B + 1, B + n + 1);
sum = B[1].first+B[n].first;
for (int i = 1;i<=(n+1)>>1;i++)
{
if (sum !=B[i].first+B[n-i+1].first)
{
cout << "NO" << endl;
return;
}
}
for (int i = 1; i <= n; i++) A[B[i].second].second = i;
for (int i = 1; i <= n; i++) while(A[i].second != i) result.push_back({i,A[i].second}), swap(A[i], A[A[i].second]);
cout <<"YES"<<endl<<result.size()<<endl;
for (auto c : result)
cout << c.first << " " << c.second << endl;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int T;
cin >> T;
while (T--) solve();
return 0;
}