Kadanes_Algorithm_MIMP.cpp

#include<bits/stdc++.h>
using namespace std;


 // } Driver Code Ends
class Solution{
    public:
    // arr: input array
    // n: size of array
    //Function to find the sum of contiguous subarray with maximum sum.
    long long maxSubarraySum(int arr[], int n){
        long long maxEnding=0;
        long long maxSoFar=INT_MIN;
        for(int i=0;i<n;i++){
            maxEnding += arr[i];
            if(maxEnding > maxSoFar)
                maxSoFar = maxEnding;
            
            if(maxEnding < 0)
                maxEnding = 0;
        }
        return maxSoFar;
    }
};

// { Driver Code Starts.

int main()
{
    int t,n;
    
    cin>>t; //input testcases
    while(t--) //while testcases exist
    {
        
        cin>>n; //input size of array
        
        int a[n];
        
        for(int i=0;i<n;i++)
            cin>>a[i]; //inputting elements of array
            
        Solution ob;
        
        cout << ob.maxSubarraySum(a, n) << endl;
    }
}
  // } Driver Code Ends