CodeForces-code/CF_1433_C.cpp at main · codesmith25103/CodeForces-code · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve()
{
    int size;
    cin>>size;
    vector<int> vec(size);
    int m1=0;
    for(int i=0; i<size; i++)
    {
        cin>>vec[i];
        m1=max(m1, vec[i]);
    }
    int count=0;
    for(int i=0; i<size; i++)
    {
        if(vec[i]==m1)
        {
            count++;
        }
    }
    if(count==size)
    {
        cout<<-1<<endl;
        return;
    }
    int ans=0;
    for(int i=0; i<size; i++)
    {
        if(vec[i]==m1)
        {
            if(i>0 && vec[i]>vec[i-1])
            {
                cout<<i+1<<endl;
                return;
            }
            if(i<size-1 && vec[i]>vec[i+1])
            {
                cout<<i+1<<endl;
                return;
            }
        }
    }
    cout<<-1<<endl;
    return;
}
int main()
{
    cin.tie(0);cin.sync_with_stdio(0);
    cout.tie(0);cout.sync_with_stdio(0);
    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}