CodeForce-Solved-Problem/Arrival_of_the_General_144_A.cpp at master · vikashship/CodeForce-Solved-Problem · 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
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin >> n;
    vector<int> heights(n);

    for (int i = 0; i < n; ++i)
    {
        cin >> heights[i];
    }

    int maxHeight = *max_element(heights.begin(), heights.end());
    int minHeight = *min_element(heights.begin(), heights.end());
    int maxIndex = -1;
    int minIndex = -1;
    for (int i = 0; i < n; ++i)
    {
        if (heights[i] == maxHeight)
        {
            maxIndex = i;
            break;
        }
    }
    for (int i = n - 1; i >= 0; --i)
    {
        if (heights[i] == minHeight)
        {
            minIndex = i;
            break;
        }
    }
    int swaps = maxIndex + (n - 1 - minIndex);
    if (maxIndex > minIndex)
    {
        swaps--;
    }

    cout << swaps << endl;

    return 0;
}