/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 vote254 views1 answer
Return multiple objects from a function C++ using references
C++
0 vote320 views1 answer
Youtube Video Downloder Website
C++
0 vote263 views2 answers
Sort using comparator anonymous function c++
C++
0 vote276 views1 answer
Creating node in c++
C++
0 vote334 views1 answer
How to convert int to FString c++ ue4
C++
7 votes241 views2 answers
Min heap stl
C++
1 vote256 views2 answers
C++ example
C++
4 votes280 views3 answers
Convert int to binary string c++
C++
0 vote254 views1 answer
Google pdf iframe viwer
C++
3 votes237 views2 answers
C++ input integer
C++