Brute Force for max sum
12345678910111213141516171819202122232425262728
#include <iostream>
using namespace std;
int maxSum(int A[] , int n){
int max =0;
for(int i=0 ; i<n; i++){
int current = 0;
for(int j=i; j<n; j++){
current += A[j];
if(current > max)
max = current;
}
}
return max;
}
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