/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

1 vote257 views1 answer
Eosio check account exist
C++
0 vote241 views2 answers
Greatest and smallest in 3 numbers cpp
C++
0 vote237 views1 answer
C++ rgb code
C++
0 vote258 views1 answer
All permutations with repetition C++
C++
4 votes260 views1 answer
Clear file before writing c++
C++
0 vote266 views1 answer
Error: initialization with "{...}" expected for aggregate object - c++
C++
0 vote264 views1 answer
C++ compare time
C++
-1 vote228 views2 answers
Run cpp code
C++
326 votes395 views3 answers
How to remove to an Array
C++
0 vote250 views1 answer
Rotation 2d d'un point
C++