/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

32 votes137 views11 answers
While loop c++
C++
0 vote183 views1 answer
Character cin(userInput) in c++
C++
0 vote190 views1 answer
Frequency of a substring in a string c++
C++
7 votes179 views5 answers
Stack in c++
C++
17 votes187 views6 answers
Find max value in array c++
C++
1 vote239 views1 answer
Joining two vectors in c++
C++
6 votes177 views3 answers
C++ dynamic array
C++
5 votes189 views5 answers
Convert char to int c++
C++
1 vote177 views1 answer
Parallelize for loop c++
C++
0 vote168 views1 answer
How to use tostring method in c++
C++