/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 vote191 views1 answer
How to declare a vector of int in c++
C++
0 vote204 views1 answer
Statement that causes a function to end in c++
C++
14 votes208 views4 answers
Converting to string c++
C++
0 vote149 views1 answer
Get data from a content editable div
C++
0 vote215 views1 answer
Tic toc toe c++
C++
0 vote201 views1 answer
Memset array bool
C++
0 vote191 views1 answer
Remove element from c++
C++
0 vote183 views1 answer
C++ error missing terminating character
C++
0 vote180 views2 answers
Create a file
C++
-1 vote193 views2 answers
Casting cpp
C++