-
Notifications
You must be signed in to change notification settings - Fork 0
/
Kadane's_Algorithm.cpp
56 lines (41 loc) · 1.1 KB
/
Kadane's_Algorithm.cpp
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
53
54
55
56
//https://practice.geeksforgeeks.org/problems/kadanes-algorithm-1587115620/1/?problemStatus=solved&page=1&query=problemStatussolvedpage1
#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.
int maxSubarraySum(int arr[], int n){
// Your code here
int max = INT_MIN;
int point = 0;
for(int i=0;i<n;i++){
point += arr[i];
if(point>max){
max=point;
}
if(point<0){
point=0;
}
}
return max;
}
};
// { 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