Project/kadanes-algorithm at main · Saumiya-Ranjan/Project · 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
45
46
47
48
49
50
51
52


 // } 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 int sum=0;
        long long int maxi=INT_MIN;
       for(int i=0;i<n;i++){
          sum=sum+arr[i];
          maxi=max(maxi,sum);
          if(sum<0){
              sum=0;
          }

    }
    // if(maxi>0){
    // return maxi;
    // }
    // else{
    //     return -1;
    // }
    return maxi;
    }
};

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