/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

3 votes142 views1 answer
C++ program to reverse an array
C++
0 vote148 views3 answers
Online convert c++ code to assembly language
C++
3 votes124 views1 answer
Initialzing a 2d vector in cpp
C++
1 vote119 views1 answer
Cpp cin
C++
0 vote131 views1 answer
Disallowcopy c++
C++
2 votes185 views2 answers
Include cpp
C++
0 vote181 views1 answer
C++ program transpose of matrix
C++
9 votes109 views5 answers
Priority queue c++ min heap
C++
-1 vote192 views5 answers
Memset in c++
C++
1 vote139 views1 answer
Print linkedstack cpp
C++