/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 vote202 views1 answer
Cuda copy memory
C++
1 vote212 views1 answer
64 bit unsigned integer c++
C++
5 votes197 views1 answer
C++ is string a number
C++
0 vote204 views1 answer
Run c++ program mac
C++
0 vote170 views1 answer
Run program until ctrl-d c++
C++
0 vote168 views1 answer
Qt insert image in widget
C++
0 vote205 views1 answer
Map float
C++
1 vote180 views3 answers
C++ split string on newline
C++
8 votes181 views2 answers
C++ function of find maximum value in an array
C++
0 vote202 views1 answer
Fisher–Yates shuffle Algorithm c++
C++