/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 vote256 views1 answer
How to make sure the user inputs a int and not anything else c++
C++
6 votes250 views2 answers
Min heap priority queue c++
C++
13 votes263 views4 answers
How to lock and hide the cursor unity
C++
3 votes265 views1 answer
C++ check if string is empty
C++
0 vote280 views1 answer
C++ find minimum value in vector
C++
0 vote264 views3 answers
C++ tuple
C++
0 vote260 views1 answer
Ind the number of digits of a given integer n .
C++
0 vote243 views1 answer
Initialize a vector with another vector c++ complexity
C++
2 votes210 views1 answer
First missing integer leetcode
C++
1 vote279 views2 answers
C++ code for selection sort
C++