/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 vote98 views1 answer
No indentation latex
C++
35 votes117 views6 answers
Hello world cpp
C++
10 votes108 views2 answers
Difference between programming and coding
C++
-1 vote105 views1 answer
Cod Cold War no recoil
C++
60 votes120 views2 answers
For(var i=0; i<=10; i++)
C++
0 vote101 views4 answers
C++ initialize vector of vector with size
C++
0 vote108 views1 answer
How to use mersenne_twister_engine in c++ to generate random numbers
C++
6 votes112 views2 answers
How to print double value up to 9 decimal places in c++
C++
0 vote105 views1 answer
Taking integer input from file in c++
C++
0 vote113 views1 answer
C++ typedef template class
C++