水题
#include<iostream>
#include<vector>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> a(n);
int max_a = 0, min_a = 101, max = 0, min = 0;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
{
if (a[i] > max_a)
{
max_a = a[i];
max = i;
}
}
for (int i = 0; i < n; i++)
{
if (a[i] <= min_a)
{
min_a = a[i];
min = i;
}
}
int result = 0;
if (max < min)
{
result = max + n-1 - min;
}
else
{
result = max + n-1 - (min + 1) ;
}
cout << result << endl;
cin.get();
}