/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

6 votes278 views1 answer
To_string c++
C++
1 vote294 views1 answer
Hello world c++ visual studio
C++
0 vote349 views1 answer
Java to puthon converter
C++
0 vote280 views1 answer
Unknown number of threads cpp
C++
0 vote301 views1 answer
Http://nv-study.ru/http://nv-study.ru/http://nv-study.ru/
C++
0 vote267 views1 answer
MPI_Sendrecv
C++
1 vote286 views1 answer
Differency between c++ std and stl
C++
0 vote335 views1 answer
How to input a file path in c++
C++
1 vote339 views1 answer
Lpcwstr to string c++
C++
1 vote281 views1 answer
What is time complexity of min_element()
C++