/**
knakul853
**/
class Solution {
public:
    int maxSubArray(vector<int>& nums) {
        int n = nums.size();
        if(n==0)return 0;

        int best =  INT_MIN;
        int cur = 0;

        for(const int& num :  nums )
        {
            cur = max( cur, 0 );
            cur = max(num, cur +num ); // subarray might start from here or continue with previous.
            best = max(best, cur);
        }

        return best;
    }
};