/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

20 votes306 views3 answers
How to append to a vector c++
C++
0 vote256 views1 answer
"++i + ++i" explanation
C++
6 votes225 views2 answers
What is heap buffer overflow
C++
2 votes245 views2 answers
How to make a c++ program run in the background
C++
0 vote247 views1 answer
New expression
C++
0 vote244 views1 answer
MPI_PUT
C++
1 vote274 views1 answer
C++ product of vector
C++
1 vote303 views1 answer
Error C4840: non-portable use of class 'FString' as an argument to a variadic function
C++
38 votes339 views6 answers
How to print hello world in c++
C++
2 votes267 views1 answer
C++ print colorful
C++