Codechef-Solutions/END SORTED.cpp at main · abhinav8925/Codechef-Solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
/*
  ***** !!!!! JAI SHREE KRISHNA !!!!! *****

  Date - 2nd February  2023
  Code by - Abhinav Anand

  Problem link -> https://www.codechef.com/problems/ENDSORTED

*/

#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
#define ll long long int
#define endl "\n"
using namespace std;

bool isprime(int n)
{
    for(int i=2;i<=sqrt(n);i++)
    {
        if(n%i==0)
            return false;
    }
    return true;
}

void solve()
{
    int n;
    cin>>n;
    int a[n];
    int minpos=n+1,mn=INT_MAX;
    int maxpos=-98,mx=INT_MIN;
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
        if(a[i]==1)
            minpos=i+1;
        else if(a[i]==n)
            maxpos=i+1;
    }


    if(a[0]==mn && a[n-1]==mx)
        cout << 0 << endl;
    else if(minpos>maxpos && a[0]!=1 && a[n-1]!=n)
        cout << n-maxpos+abs(1-minpos)-1 << endl;
    else
        cout << abs(1-minpos)+abs(n-maxpos) << endl;

}

int main() {

    int t;
    cin>>t;
    while(t--)
    {
        solve();
    }

	return 0;
}