/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 vote346 views1 answer
C++ check if number is even or odd
C++
1 vote407 views1 answer
How to get double y dividing 2 integers in c++
C++
4 votes349 views2 answers
Getting a random letter in c++
C++
3 votes359 views2 answers
C++ code for quicksort
C++
0 vote326 views1 answer
Arraylist equivalent cpp
C++
30 votes328 views2 answers
Integer range in c++
C++
4 votes310 views1 answer
C++ array vs vector
C++
8 votes411 views10 answers
Javascript loop array
C++
0 vote326 views1 answer
C++ nerds
C++
4 votes320 views1 answer
Git branch in my bash prompt
C++