Kadane's Algo
123456789101112131415161718192021222324252627
#include <iostream>
using namespace std;
int maxSum(int A[], int n){
int max_current = A[0] ,max_global = A[0];
for(int i=1 ; i<n; i++){
max_current = max( A[i], max_current + A[i] );
if(max_current > max_global)
max_global = max_current;
}
return max_global;
}
int main() {
int n;
cin>>n;
int A[n];
for(int i =0 ; i < n; i++){
cin>>A[i];
}
cout<<maxSum(A,n);
}
Cpp
INFO