[second]Maximum Subarray

 

    int maxSubArray(int A[], int n) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        if(n<=0)
            return 0;
        int curMax = INT_MIN;
        int sum = 0;
        for(int i=0;i<n;i++)
        {
            if(sum<=0)
                sum = 0;
            sum += A[i];
            if(sum>curMax)
                curMax = sum;
        }
        return curMax;
    }