Algorithms/Kadane's Algorithm at 2194ce7b9b4abc66f9618317ad95181f19172fba · codeIIEST/Algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
// { Driver Code Starts
#include<bits/stdc++.h>
using namespace std;


 // } Driver Code Ends


// Function to find subarray with maximum sum
// arr: input array
// n: size of array
int maxSubarraySum(int arr[], int n){

    // Your code here
    int current=arr[0],overall=arr[0];
    for(int i=1;i<n;i++){
        if((current+ arr[i])<arr[i]){current=0;}
        current+=arr[i];
        if(current>overall){overall=current;}
    }
    return overall;
}

// { 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

        cout << maxSubarraySum(a, n) << endl;
    }
}
  // } Driver Code Ends