/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 vote319 views1 answer
9+20
C++
0 vote316 views2 answers
Accepting multiple values from a function in cpp
C++
2 votes349 views1 answer
Recursive binary search
C++
0 vote292 views3 answers
C++ Dynamic allocation failing
C++
0 vote298 views1 answer
How to get the last element of an array in C++ using std::array
C++
0 vote314 views1 answer
Bit++ codeforces in c++
C++
0 vote317 views1 answer
C++ remove numbers from vector if larger than n
C++
0 vote347 views1 answer
If(arr[i]==k) return arr[i];
C++
0 vote299 views1 answer
Pascal's triangle in c++ through pointer
C++
-1 vote312 views1 answer
Equal elements in two arrays in c++
C++