class Solution:
    def shortestSubarray(self, A: [int], K: int) -> int:
        diff_nums = []
        for i in range(len(A)):
            sum += A[i]
            diff_nums.append(sum)



        return


def main():
    A = [8, 1, 5, 2, 6]
    solution = Solution()
    print(solution.maxScoreSightseeingPair(A))


if __name__ == '__main__':
    main()
