算法之最大连续子序列之和之变形题目
Here are n numbers.
You have a magic : first , you choose a interval [l,r],and then each Si(l
You can use the magic at most once to make sum of all the numbers to be maximum.
What is the maximum
原创
2015-06-06 22:49:03 ·
840 阅读 ·
0 评论