【Lintcode】1793. Balanced Sales Array

题目地址： https://www.lintcode.com/problem/balanced-sales-array/descriptionhtml 给定一个数组 A A A，求某个下标 k k k使得 ∑ i = 1 k − 1 A [ i ] = ∑ i = k + 1 l A − 1 A [ i ] \sum_{i=1}^{k-1}A[i]=\sum_{i=k+1}^{l_A-1}A[i]

>>阅读原文<<