/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 vote292 views1 answer
Char size length c++
C++
-1 vote296 views1 answer
C++ if else
C++
0 vote304 views1 answer
Cpp convert vector to set
C++
1 vote305 views1 answer
Sony pictures animation films produced
C++
-1 vote283 views1 answer
Socket programming in cpp
C++
4 votes306 views4 answers
How to get last element of set in c++
C++
0 vote344 views1 answer
Array must be initialized with a brace-enclosed initializer
C++
0 vote303 views1 answer
Print all substrings in c++
C++
0 vote337 views1 answer
Delete a node from binery search tree c++
C++
1 vote372 views1 answer
How to get double y dividing 2 integers in c++
C++