tamarous
/ maxSequenceSum.cpp
Last active
October 10, 2016 12:53
求最大子序列和，如果求出来的值为负数，则返回0。时间复杂度：O(NlogN)
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <iostream> | |
| using namespace std; | |
| int max(int a,int b,int c) | |
| { | |
| return a>b?(a>c?a:c):(c>b?c:b); | |
| } | |
NewerOlder