/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 vote138 views2 answers
Iostream c++
C++
0 vote138 views1 answer
Udo apt install dotnet-sdk-5 permission denied
C++
0 vote154 views1 answer
C++ random int troll
C++
0 vote142 views1 answer
Are maps sorted c++
C++
-2 votes130 views1 answer
C++ press any key
C++
1 vote162 views1 answer
Multithreading
C++
0 vote86 views1 answer
Two D Arrays
C++
1 vote147 views1 answer
C++ multithreading
C++
-1 vote127 views2 answers
Run cpp code
C++
0 vote147 views1 answer
Pointeur cpp
C++