Codeforces Round #772 (Div. 2) 1635C - Differential Sorting Solution

 Problem Link:    https://codeforces.com/contest/1635/problem/C

Solution in C++:

///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

#include <bits/stdc++.h>

using namespace std;

int main()

{

    long long n,t,i,r;

    cin>>t;

    while(t--)

    {

        cin>>n;

        int a[n+9];

        for(i=1; i<=n; i++)cin>>a[i];

        if((a[n]>=a[n-1])&&(a[n]>=0))

        {

            cout<<n-2<<endl;

            for(i=1; i<=n-2; i++)

                cout<<i<<" "<<n-1<<" "<<n<<endl;

        }

        else if(is_sorted(a+1,a+n+1))

            cout<<"0"<<endl;

        else

            cout<<"-1"<<endl;

    }

}