Function main

Codeforces_problems/Dominant Piranha/solution.cpp:15–73

using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t;
    cin >> t;
    while (t--)
    {
        int n;
        cin >> n;
        int a[n];
        int maxi = INT_MIN;
        for (int i = 0; i < n; i++)
        {
            cin >> a[i];
            if (maxi < a[i])
            {
                maxi = a[i];
            }
        }
        bool status = true;
        int i = 0;
        while (i < n - 1)
        {
            if (a[i] != a[i + 1])
            {
                status = false;
                break;
            }
            i++;
        }
        if (status)
        {
            cout << -1 << endl;
        }
        else
        {
            int i = 0;
            bool status = true;
            while (i < n && status)
            {
                if (a[i] == maxi)
                {
                    if (i > 0 && a[i] != a[i - 1])
                    {
                        status = false;
                    }
                    if (i < n - 1 && a[i] != a[i + 1])
                    {
                        status = false;
                    }
                }
                i++;
            }
            cout << i << endl;
        }
    }
    return 0;