::我竟然pair存值和下标 排序,二分找下标;计算,弄复杂了
#include <iostream>}
#include <algorithm>
#include <cstring>
using namespace std;
const int N=110;
int a[N];
int maxs=0,mins=1e9;
int main()
{
int n;
cin>>n;
int x,y;
for(int i=1;i<=n;i++)
{
cin>>a[i];
if(a[i]<=mins)//记录最大值和坐标;
{
mins=a[i];
x=i;
}
if(a[i]>maxs)
{
maxs=a[i];
y=i;
}
}
int ans=y-1+n-x;
if(y>x)ans--;
cout<<ans;
}