CodeForces 144A Arrival of the General

A. Arrival of the General
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
A Ministry for Defense sent a general to inspect the Super Secret Military Squad under the command of the Colonel SuperDuper. Having learned the news, the colonel ordered to all n squad soldiers to line up on the parade ground.

By the military charter the soldiers should stand in the order of non-increasing of their height. But as there’s virtually no time to do that, the soldiers lined up in the arbitrary order. However, the general is rather short-sighted and he thinks that the soldiers lined up correctly if the first soldier in the line has the maximum height and the last soldier has the minimum height. Please note that the way other solders are positioned does not matter, including the case when there are several soldiers whose height is maximum or minimum. Only the heights of the first and the last soldier are important.

For example, the general considers the sequence of heights (4, 3, 4, 2, 1, 1) correct and the sequence (4, 3, 1, 2, 2) wrong.

Within one second the colonel can swap any two neighboring soldiers. Help him count the minimum time needed to form a line-up which the general will consider correct.

Input
The first input line contains the only integer n (2 ≤ n ≤ 100) which represents the number of soldiers in the line. The second line contains integers a1, a2, …, an (1 ≤ ai ≤ 100) the values of the soldiers’ heights in the order of soldiers’ heights’ increasing in the order from the beginning of the line to its end. The numbers are space-separated. Numbers a1, a2, …, an are not necessarily different.

Output
Print the only integer — the minimum number of seconds the colonel will need to form a line-up the general will like.

Examples
input
4
33 44 11 22
output
2
input
7
10 10 58 31 63 40 76
output
10
Note
In the first sample the colonel will need to swap the first and second soldier and then the third and fourth soldier. That will take 2 seconds. The resulting position of the soldiers is (44, 33, 22, 11).

In the second sample the colonel may swap the soldiers in the following sequence:

(10, 10, 58, 31, 63, 40, 76)
(10, 58, 10, 31, 63, 40, 76)
(10, 58, 10, 31, 63, 76, 40)
(10, 58, 10, 31, 76, 63, 40)
(10, 58, 31, 10, 76, 63, 40)
(10, 58, 31, 76, 10, 63, 40)
(10, 58, 31, 76, 63, 10, 40)
(10, 58, 76, 31, 63, 10, 40)
(10, 76, 58, 31, 63, 10, 40)
(76, 10, 58, 31, 63, 10, 40)
(76, 10, 58, 31, 63, 40, 10)
链接：https://codeforces.ml/problemset/problem/144/A
题意：交换，使得最大的数在前面，最小的在最后面
思路：本题n的范围比较小，可以考虑直接两两交换，但是还有更方便的做法 就是–找出最大和最小的元素，计算他们到头和尾的距离就好了
ac代码如下：

#include<iostream>
#include<cstdio>
using namespace std;
int main(){
	int t,max=0,min=0;
	int a[102];
	cin>>t;
	for(int i=0;i<t;i++){
		cin>>a[i];
		if(a[i]>a[max]) max = i;
		if(a[i]<=a[min]) min = i;
	}
	if(max<min){
		cout<<max-1 + t-min<<endl;//当最大值在最小值左边的时候，例如案例1
		//只要计算max到1之间的距离+min到t之间的距离即可
	}else{
		cout<<max-1 + t-min-1<<endl;//当最大值在最小值右边的时候，例如案例2
		//只要计算max到1之间的距离+min到t之间的距离-1即可（-1是因为max往前交换了之后min自然也向右移动了一步）
	}
}