/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

8 votes151 views5 answers
Sum of vector c++
C++
1 vote169 views1 answer
Find the graph is minimal spanig tree or not
C++
0 vote138 views1 answer
Recherche recursive le max dans une liste
C++
0 vote150 views1 answer
Dream speedrun music free download mp3
C++
0 vote148 views7 answers
C code to mips assembly converter online
C++
0 vote130 views1 answer
Print maximum sum subarray
C++
-1 vote136 views1 answer
A[12] = h + A[8]
C++
0 vote143 views1 answer
Arduino C++ servomotor random moving
C++
0 vote144 views1 answer
C++ error missing terminating character
C++
0 vote166 views1 answer
Lexene token pairs of java codes
C++