/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

12 votes349 views2 answers
Copy constructor c++ syntax
C++
0 vote379 views1 answer
Stack overflow c++
C++
0 vote339 views1 answer
Access part of string in c++
C++
0 vote358 views1 answer
Remove a element from an array c++
C++
12 votes383 views4 answers
How to initialized a 2d vector
C++
0 vote350 views1 answer
Arduino buildin let
C++
2 votes368 views2 answers
Decltype in c++
C++
0 vote325 views1 answer
How to play sound in c++
C++
-1 vote358 views2 answers
Open url from dev cpp
C++
0 vote352 views1 answer
C++ little endian or big endian
C++