/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 vote770 views1 answer
C++ string erase all occurrences
C++
1 vote173 views3 answers
Comment in c++
C++
0 vote165 views1 answer
Simple C++ game code
C++
0 vote177 views1 answer
Powershell script query mssql windows authentication
C++
0 vote168 views1 answer
Cpp array init value
C++
0 vote473 views1 answer
Cpp Case value is not a constant expression
C++
0 vote169 views1 answer
Sfml thread multi argument function
C++
1 vote158 views3 answers
For vector c++
C++
0 vote218 views1 answer
String to decimal c++ strtol
C++
1 vote175 views1 answer
Naive pattern matching algorithm
C++