Codeforces Round #771 (Div. 2) 1638A - Reverse Solution

 

                                         

                                          

Problem Link: https://codeforces.com/contest/1638/problem/A

Solve 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,l,r;

    cin>>t;

    while(t--)

    {

        cin>>n;

        vector<int>v;

        int a[n+9];

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

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

        {

            if(a[i]!=i)

            {

                l=i;

                break;

            }

            else

                v.push_back(a[i]);

        }

        for(i=l+1; i<=n; i++)

        {

            if(a[i]==l)

            {

                 for(int j=i;j>=l;j--)v.push_back(a[j]);

                 for(int j=i+1;j<=n;j++)v.push_back(a[j]);

                break;

            }

        }

        for(i=0;i<v.size();i++)cout<<v[i]<<" ";

        cout<<endl;

    }

}