/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 vote175 views1 answer
C++ shift array to the right
C++
0 vote181 views7 answers
C++ convert to assembly language
C++
39 votes260 views6 answers
How to Add to an Array
C++
1 vote191 views1 answer
C++ code for bubble sort
C++
14 votes191 views4 answers
C++ define vector with size
C++
97 votes516 views6 answers
Change int to string c++
C++
1 vote191 views1 answer
C++ default array value not null
C++
0 vote191 views1 answer
One dimensiol array to two dimen c++
C++
1 vote201 views2 answers
C++ cast to type of variable
C++
0 vote213 views1 answer
Find largest number in each row in array c++ using function
C++