摘要： Non-negative Partial SumsTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1420Accepted Submission(s): 544Problem DescriptionYou are given a sequence of n numbers a0,..., an-1. A cyclic shift by k positions (0=0 的个数。 7 想了一下，思路有了。可以这样子。 8 任意前i数和都满足> 阅读全文