CompetitiveProgrammingProblems/practice.py at main · Travis544/CompetitiveProgrammingProblems · 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

def findKing(num):
    for i in range(2, len(num)-1):
        # if int(num[i])>int(num[i-1]) and int(num[i])>int(num[i+1]):
        #     return i
        # elif int(num[i])<int(num[i-1]) and int(num[i])<int(num[i+1]):
        #     return
        #
        if int(num[i])-int(num[i-1])>1 or int(num[i])-int(num[i-1])<1:
            return i


        # if int(num[i])>int(num[i+1]):
        #     return i+1

num=input()
if num:

    res=[]
    lines=[]
    for i in range(int(num)):
        line=input()
        lines.append(line)

    for line in lines:
        index=findKing(line.split(" "))
        res.append(index)
    for val in res:
        print(val)