/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

5 votes227 views5 answers
Convert char to int c++
C++
0 vote243 views1 answer
Cpp map contains
C++
0 vote236 views1 answer
C++ drop last element of list
C++
2 votes227 views1 answer
C++ read console input
C++
3 votes223 views6 answers
C++ loop
C++
1 vote234 views1 answer
What is difffrence between s.length() and s.size()
C++
0 vote229 views1 answer
Pointers mcq sanfoundry
C++
0 vote272 views1 answer
Day 21 generics hackerrank solution in c++
C++
1 vote219 views1 answer
Union of two arrays leetcode
C++
3 votes245 views1 answer
Differentialble programming
C++