/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 vote294 views1 answer
How to use power in c++
C++
0 vote233 views1 answer
Count bit 1 c++
C++
0 vote222 views1 answer
Cpp function that returns two arguments
C++
0 vote281 views1 answer
C++ class constructor variable arguments
C++
0 vote259 views1 answer
>> c++
C++
3 votes314 views2 answers
C++ map insert
C++
4 votes271 views1 answer
Sort vector struct c++
C++
3 votes237 views1 answer
Resizing dynamic array c++
C++
0 vote261 views1 answer
How to use mersenne_twister_engine in c++ to generate random numbers
C++
0 vote284 views1 answer
Google test assert exception
C++