/C++/Find maximum sum of circular subarray

Find maximum sum of circular subarray

#include <iostream>

using namespace std;

int kadane(int arr[], int n)
{
    int currentSum = 0;
    int maxSum = INT_MIN;
    for (int i = 0; i < n; i++)
    {
        currentSum += arr[i];
        if (currentSum < 0)
        {
            currentSum = 0;
        }
        maxSum = max(maxSum, currentSum);
    }

    return maxSum;
}
int main()
{
    //Input Array
    int n;
    cin >> n;
    int arr[n];
    for (int i = 0; i < n; i++)
    {
        cin >> arr[i];
    }

    int wrapsum, totalsum = 0;
    int nonwrapsum;

    nonwrapsum = kadane(arr, n);

    for (int i = 0; i < n; i++)
    {
        totalsum += arr[i];
        arr[i] = -arr[i];
    }
    wrapsum = totalsum + kadane(arr, n);
    cout << max(wrapsum, nonwrapsum) << endl;

    return 0;
}

Similar codes

0 vote325 views1 answer
Even number program in c++ using for loop stack overflow
C++
-1 vote363 views1 answer
C++ how to return an empty vector
C++
1 vote301 views1 answer
Arduino funktion
C++
0 vote317 views1 answer
Reading in lines from a file to a vector c++
C++
1 vote331 views1 answer
Cuda dim3
C++
1 vote379 views1 answer
Qt float to qstring
C++
0 vote413 views1 answer
C++ generic pointer
C++
1 vote278 views1 answer
Add element to start of vector c++
C++
3 votes384 views3 answers
C++ string contains
C++
0 vote333 views1 answer
Add comment in c/c++
C++