懒得放问题讨论区了。
#include <bits/stdc++.h>
using namespace std;
int a[55], p1[55], p2[55], p3[55];
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int s = 1, sum = 0, pt = 0;
for (int i = 1; i <= n; i++) {
int minn = 1e9, t = 0;
for (int j = s; j <= n; j++) {
int f = minn;
minn = min(minn, a[j]);
if (minn != f) {
t = j;
}
}
for (int j = t - 1; j >= s; j--) {
swap(a[j + 1], a[j]);
}
if(t==s) continue;
pt++;
p1[pt] = s;
p2[pt] = t;
p3[pt] = t - s;
sum++;
s++;
}
cout << sum << endl;
for (int i = 1; i <= sum; i++) {
cout << p1[i] << " " << p2[i] << " " << p3[i] << endl;
}
}
}