/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 vote142 views1 answer
PascalName seperate strings
C++
0 vote145 views1 answer
C++ declare binary number
C++
10 votes149 views2 answers
C++ convert binary string to decimal
C++
1 vote128 views1 answer
Is C++ useful in 2021
C++
6 votes145 views2 answers
Create dynamic array c++
C++
2 votes155 views2 answers
C++ while true loop
C++
1 vote155 views1 answer
How to make a parameter optional in c++
C++
0 vote149 views1 answer
Bit++ codeforces in c++
C++
-1 vote159 views1 answer
Arrays left rotation hackerrank solution
C++
0 vote109 views1 answer
1ll
C++