1. 寻找最后的山峰
nums=list(map(int, input().split(' ')))
nums.insert(0,float('-inf'))
nums.append(float('-inf'))
length=len(nums)
index_list = []
for i in range(1,length-1):
if nums[i]>=nums[i-1] and nums[i]>=nums[i+1]:
index_list.append(i-1)
print(index_list[-1])
2.棋子翻转
a = eval(input())
b = eval(input())
for x, y in b:
x -= 1
y -= 1
if x > 0:
a[x-1][y] = 1 - a[x-1][y]
if x < 3:
a[x+1][y] = 1 - a[x+1][y]
if y > 0:
a[x][y-1] = 1 - a[x][y-1]
if y < 3:
a[x][y+1] = 1 - a[x][y+1]
print(str(a).replace(" ", ""))
3.比大小
暴力解:A 60%
import sys
li=list(map(int,sys.stdin.readlines()))
number,array=li[0],li[1:]
for i in range(number-1):
for j in range(i+1, number):
if array[j]>array[i]:
print(j-i)
break
if j==number-1:
print(-1)
print(-1)