Codeforces Round #103 (Div. 2), problem: (A) Arrival of the General solution

Codeforces Round #103 (Div. 2), problem: (A) Arrival of the General: http://codeforces.com/problemset/problem/144/A

Codeforces Round #103 (Div. 2), problem: (A) Arrival of the General editorial: http://codeforces.com/blog/entry/3693

Codeforces Round #103 (Div. 2), problem: (A) Arrival of the General solution: http://ideone.com/zVGB2I

#include <iostream>
#include <cstdio>
#include <climits>
using namespace std;

int main() {
    int n, a[105], ma=INT_MIN, mi=INT_MAX, ima, imi, ans;
    scanf("%d", &n);
    for(int i=0; i<n; i++) {
        scanf("%d", &a[i]);
        if(a[i]>ma) ma=a[i], ima=i;
        if(a[i]<=mi) mi=a[i], imi=i;
    }
    ans=ima+(n-1-imi);
    if(imi<ima) ans--;
    printf("%d", ans);
    return 0;
}