/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 vote293 views1 answer
C++ meaning ::
C++
0 vote306 views1 answer
Operators on strings c++
C++
8 votes290 views5 answers
C++ vector resize
C++
23 votes310 views10 answers
Pycharm
C++
0 vote299 views1 answer
Power Function in C/C++
C++
0 vote271 views1 answer
How to add an element to std::map
C++
0 vote310 views1 answer
Argument to number C++
C++
0 vote350 views1 answer
Cpp serial print override always in same place
C++
5 votes299 views6 answers
If arduino
C++
0 vote271 views2 answers
C++ program to convert celsius to fahrenheit
C++