逆序對,把其中一個改成0,問改哪個獲得的逆序對最少,以及最終多少個逆序對。
時間超了。
import copy
n =int(input())
li = [int(x) for x in input().split()]
count_list=[]
for i in range(n):
n1=copy.deepcopy(li)
n1[i]=0
count=0
for j in range(n):
for k in range(j+1,n):
# print(n1[j],n1[k])
if n1[j]>n1[k]:
count+=1
count_list.append(count)
print(min(count_list), count_list.index(min(count_list))+1)