#include "bits/stdc++.h"
using namespace std;
int main()
{
int N;
cin >>N;
while (N--)
{
int n;
cin >> n;
int a[n+1];
for (int i = 1; i <= n; i++)
cin >> a[i];
int ans=0;
int c[n+1][4];
for(int i=0;i<n;i++)
{
int l=i+1;
int r=i+1;
for(int j=i+1;j<=n;j++)
{
if(a[j]<a[r])
r=j;
}
int d=r-l;
if(d>0)
{
ans++;
} else
continue;
int len=d+1;
int b[n+1];
c[ans][1]=l;
c[ans][2]=r;
c[ans][3]=d;
for(int j=l;j<=r;j++)
{
int num=j-d;
if(num<l)
num+=len;
b[num]=a[j];
}
for(int j=l;j<=r;j++)
a[j]=b[j];
}
cout << ans << endl;
if(ans!=0)
for(int i=1;i<=ans;i++)
{
cout << c[i][1] << " " << c[i][2] << " " << c[i][3] << endl;
}
}
}
Codeforces Round #744 (Div. 3) B. Shifting Sort
最新推荐文章于 2022-07-05 16:32:22 发布