1838B - Minimize Permutation Subarrays - CodeForces Solution

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <climits>
#include <set>
#include <cstring>
#include <map>
#include <cmath>
#include <queue>

using namespace std;
typedef long long ll;
#define endl "\n";

void solve() {
    int n;
    cin >> n;
    vector<int> a(n);
    map<int, int> ind;
    for (int i=1; i<=n; i++) {
        cin >> a[i-1];
        ind[a[i-1]] = i;
    }

    if (ind[n] < ind[1] && ind[n] < ind[2]) {
        cout << ind[n] << " " << min(ind[1], ind[2]) << endl;
    } else if (ind[n] > ind[1] && ind[n] > ind[2]) {
        cout << ind[n] << " " << max(ind[1], ind[2]) << endl;;
    } else {
        cout << ind[n] << " " << ind[n] << endl;
    }
}

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