SOME_PROBLEMS/1793C.cpp at main · Prashant-900/SOME_PROBLEMS · 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
65
66
67
68
69
70
71
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t;
    cin >> t;
    while (t--)
    {
        int n;
        cin >> n;
        vector<int> arr(n);
        for (int i = 0; i < n; ++i)
            cin >> arr[i];

        vector<int> check(n, 0);
        int min_val = 1, max_val = n;
        int l = 0, r = n - 1;

        auto advance_min = [&]()
        {
            check[min_val - 1] = -1;
            while (min_val <= n && check[min_val - 1] == -1)
                ++min_val;
        };

        auto reduce_max = [&]()
        {
            check[max_val - 1] = -1;
            while (max_val >= 1 && check[max_val - 1] == -1)
                --max_val;
        };

        while (l <= r && ((arr[l] == min_val || arr[l] == max_val) || (arr[r] == min_val || arr[r] == max_val)))
        {

            if (arr[r] == min_val || arr[r] == max_val)
            {
                if (arr[r] == min_val)
                    advance_min();
                else if (arr[r] == max_val)
                    reduce_max();
                --r;
            }
            if (arr[l] == min_val || arr[l] == max_val)
            {

                if (arr[l] == min_val)
                    advance_min();
                else if (arr[l] == max_val)
                    reduce_max();
                ++l;
            }
        }

        if (l >= r)
        {
            cout << -1 << '\n';
        }
        else
        {
            cout << l + 1 << ' ' << r + 1 << '\n';
        }
    }

    return 0;
}