added a problem

Author: prshntsingh

Max_Sum_Contiguous_Subarray/Question.txt

@@ -0,0 +1,9 @@
+Find the contiguous subarray within an array (containing at least one number) which has the largest sum.
+
+For example:
+
+Given the array [-2,1,-3,4,-1,2,1,-5,4],
+
+the contiguous subarray [4,-1,2,1] has the largest sum = 6.
+
+For this problem, return the maximum sum.

Max_Sum_Contiguous_Subarray/Readme.md

@@ -0,0 +1 @@
+A good tricky problem.

Max_Sum_Contiguous_Subarray/Solution.cpp

@@ -0,0 +1,20 @@
+int Solution::maxSubArray(const vector<int> &A) {
+    int s=INT_MIN,n = A.size(),i,j,m=0,mi=INT_MAX,ma = INT_MIN;
+    int arr[n];
+    memset(arr,0,sizeof(arr));
+    
+    for(i=0;i<n;i++)
+    {
+        m+=A[i];
+       arr[i] = m; 
+    }
+    if(n==1)
+    return A[0];
+    s=arr[0];
+    for(i=0;i<n-1;i++)
+    {
+        mi = min(mi,arr[i]);
+        s = max(s,arr[i+1]-mi);
+    }
+    return s;
+}