/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

-1 vote136 views3 answers
Convert c code to c++
C++
0 vote147 views1 answer
Basic stack implementation in c++
C++
2 votes138 views1 answer
Null c++
C++
0 vote121 views1 answer
How to know the number of a certain substring in a string in c++
C++
6 votes139 views4 answers
Int to qstring
C++
-1 vote138 views1 answer
C++ changing string to double
C++
1 vote148 views1 answer
Fibonacci series in c++ Recursive
C++
10 votes149 views3 answers
C++ check if file exits
C++
1 vote137 views1 answer
Collections c# vs c++
C++
2 votes127 views1 answer
Fatal error: opencv2/opencv.hpp: No such file or directory
C++