#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define pll pair <ll,ll>
#define F first
#define S second
#define int ll
#define pb push_back
#define IOS ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
using namespace std;
using namespace __gnu_pbds;
typedef tree <pll,null_type,less <pll>,rb_tree_tag,tree_order_statistics_node_update> orduk;
typedef tree <ll,null_type,less <ll>,rb_tree_tag,tree_order_statistics_node_update> orduk2;
ll n;
vector <ll> a;
inline void init() {
cin>>n;
a.resize(n);
for (int i = 0;i < n;i++)
cin>>a[i];
}
vector <pll> ans;
inline void output() {
cout<<ans.size()<<'\n';
for (auto to:ans)
cout<<to.F<<" "<<to.S<<'\n';
exit(0);
}
inline void solve() {
while (1) {
bool found = true;
for (int i = 1;i < n;i++)
if (a[i] < a[i - 1]) {
ans.pb({i + 1,i});
ans.pb({i, i + 1});
ans.pb({i + 1,i});
swap(a[i],a[i - 1]);
found = false;
break;
}
if (found == true) break;
}
}
int32_t main() {
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
IOS;
int m;
m = 10;
m-=9;
while (m--)
{
init();
solve();
output();
}
}
/*written by Traduttore*/
/*waiting for a miracle...*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
364 KB |
Not sorted |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
364 KB |
Not sorted |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
364 KB |
Not sorted |
| 2 |
Halted |
0 ms |
0 KB |
- |
