elephants.cpp

#include <iostream>

using namespace std;

const int MAX = 5001;

int main(){

    int n, tmp, maxi = -1, mini = -1, max, min;
    int ar[100000];

    cin >> n;

    for (int i = 0; i < n; i++){
        cin >> ar[i];
    }
    min = MAX;
    max = -1;
    for (int i = 0; i < n - 1; i++){
        while (i < (n - 1) && ar[i] >= min)
            i++;
        while (i < (n - 1) && ar[i + 1] <= ar[i])
            i++;
        if (i > maxi){
            int tmpmax = -1;
            int tmpmaxi;
            for (int j = i + 1; j < n; j++){
                if (ar[j] > tmpmax){
                    tmpmaxi = j;
                    tmpmax = ar[j];
                }
            }
            if (tmpmax * min > ar[i] * max){
                max = tmpmax;
                min = ar[i];
                maxi = tmpmaxi;
                mini = i;
            }
        }else{
            if (ar[i] < min){
                min = ar[i];
                mini = i;
            }
        }
    }

    if (min >= max){
        cout << 0 << " " << 0 << endl;
    }else{
        cout << mini + 1 << " " << maxi + 1 << endl;
    }

    return 0;
}