/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 vote236 views4 answers
Online c++ to c converter
C++
0 vote181 views1 answer
Remove item from layout
C++
0 vote151 views1 answer
String hash
C++
70 votes214 views5 answers
Erase element from vector c++
C++
0 vote170 views1 answer
C++ filesystem read directory
C++
-1 vote192 views6 answers
Wine linux
C++
0 vote146 views2 answers
Change colour of output to terminal c++
C++
0 vote164 views1 answer
Hola mundo c++
C++
0 vote204 views1 answer
How to find product of a given numbers in c++
C++
1 vote154 views1 answer
HOW TO TURN LINK TO BUTTON IN MVC
C++