/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 vote166 views1 answer
Random key generator c++ all unique characters
C++
0 vote172 views1 answer
How to print a word in c++
C++
0 vote173 views1 answer
How to add numbers in c++
C++
0 vote188 views1 answer
Imports the elements in the array c++
C++
0 vote168 views1 answer
C++ Attribute Parser
C++
1 vote163 views1 answer
C++ default array value not null
C++
0 vote180 views1 answer
Error: Microsoft Visual C++ 14.0 or greater is required. Get it with "Microsoft C++ Build Tools":
C++
4 votes176 views1 answer
How to print a string to console in c++
C++
0 vote154 views4 answers
C++ to c converter
C++
-6 votes166 views3 answers
Explicit in c++ meaning
C++