Tony's Log

摘要： "How many inverted pairs" - that usually ends up with MergeSort solution (of course there are other solutions out there)def mergeSort(arr): if len(... 阅读全文

摘要： Nothing special, just some corner casesn = int(input())arr = [int(i) for i in input().strip().split()]# Collect rec = []i = 0while i arr[i + 1]: ... 阅读全文