/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

4 votes143 views2 answers
Extended euclidean algorithm
C++
0 vote132 views1 answer
C++ pi float
C++
0 vote144 views1 answer
C++ std::find with lambda
C++
8 votes142 views1 answer
Remove last letter in string c++
C++
3 votes151 views1 answer
C++ string initialization
C++
0 vote129 views1 answer
Print pattern and space in cpp
C++
0 vote131 views1 answer
How the theam are store in database
C++
1 vote102 views1 answer
How to get double y dividing 2 integers in c++
C++
6 votes142 views2 answers
C++ create thread
C++
0 vote134 views1 answer
Nested conditional operator
C++