/C++/Find maximum sum in array of contiguous subarrays

Find maximum sum in array of contiguous subarrays

#include <iostream>

using namespace std;

int main(){
    //Input Array
    int n;
    cin >> n;
    int arr[n];
    for(int i =0;i< n;i++){
    cin >> arr[i];
    }

    int currentSum = 0;
    int maxSum = INT_MIN;
    //algo
    for (int i = 0; i < n; i++)
    {
        currentSum += arr[i];
        if (currentSum <0)
        {
            currentSum = 0;
        }
        maxSum = max(maxSum, currentSum);
    }
    cout << maxSum << endl;

    return 0;
}

Find longest subarray by sum

def max_length(s, k):
    current = []
    max_len = -1 # returns -1 if there is no subsequence that adds up to k.
    for i in s:
        current.append(i)
        while sum(current) > k: # Shrink the array from the left, until the sum is <= k.
           current = current[1:]
        if sum(current) == k:
            max_len = max(max_len, len(current))

    return max_len

Source: stackoverflow.com

Similar codes

0 vote94 views1 answer
C for loop decrement
C++
0 vote114 views1 answer
Faster solutions
C++
1 vote130 views1 answer
How to print with the bool value in cpp
C++
4 votes103 views1 answer
Arduino uno hello world
C++
0 vote102 views1 answer
C++ error missing terminating character
C++
1 vote100 views4 answers
Return function in cpp
C++
0 vote100 views1 answer
C++, for-loop over an array array
C++
0 vote121 views1 answer
Find maximum sum of circular subarray
C++
0 vote114 views1 answer
For loop in c++ hackerrank solution
C++
0 vote119 views1 answer
Int and char in c++ compiler
C++