smallest sum contiguous subarray solution added

Author: pranava7

Dynamic Programming/Smallest contiguous array sum.cpp

@@ -0,0 +1,46 @@
+// C++ implementation to find the smallest sum
+// contiguous subarray
+#include <bits/stdc++.h>
+
+using namespace std;
+
+// function to find the smallest sum contiguous subarray
+int smallestSumSubarr(int arr[], int n)
+{
+	// to store the minimum value that is ending
+	// up to the current index
+	int min_ending_here = INT_MAX;
+	
+	// to store the minimum value encountered so far
+	int min_so_far = INT_MAX;
+	
+	// traverse the array elements
+	for (int i=0; i<n; i++)
+	{
+		// if min_ending_here > 0, then it could not possibly
+		// contribute to the minimum sum further
+		if (min_ending_here > 0)
+			min_ending_here = arr[i];
+		
+		// else add the value arr[i] to min_ending_here
+		else
+			min_ending_here += arr[i];
+		
+		// update min_so_far
+		min_so_far = min(min_so_far, min_ending_here);		
+	}
+	
+	// required smallest sum contiguous subarray value
+	return min_so_far;
+}
+
+
+// Driver program to test above
+int main()
+{
+	int arr[] = {3, -4, 2, -3, -1, 7, -5};
+	int n = sizeof(arr) / sizeof(arr[0]);
+	cout << "Smallest sum: "
+		<< smallestSumSubarr(arr, n);
+	return 0;	
+}