/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

3 votes177 views2 answers
C++ round number to whole
C++
19 votes144 views1 answer
Dev c++
C++
19 votes187 views6 answers
Initialize 2D vector
C++
-1 vote127 views1 answer
I'm still here lyrics
C++
0 vote130 views1 answer
Cuda copy memory
C++
0 vote133 views1 answer
Cube mapping sdl
C++
0 vote113 views1 answer
Check alphabet c++
C++
19 votes116 views1 answer
Access last element in vector in c++
C++
0 vote135 views1 answer
Heap allocated array in c ++
C++
54 votes170 views2 answers
C# toint
C++