/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

0 vote105 views1 answer
What is c++ file extension
C++
2 votes102 views1 answer
Dangling Pointer
C++
1 vote105 views1 answer
Isalpha c++
C++
1 vote93 views1 answer
C++ find in pair
C++
1 vote201 views1 answer
Typedef vector c++
C++
1 vote122 views1 answer
Can you verify adsense no ssl certificate
C++
0 vote98 views1 answer
Fstring from float c++ ue4
C++
0 vote123 views1 answer
Run c++ program mac
C++
-1 vote92 views1 answer
Cod Cold War no recoil
C++
0 vote133 views1 answer
C++ uint32_t
C++