/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

1 vote235 views1 answer
C++ isalphanum
C++
0 vote208 views2 answers
The code execution cannot proceed because glew32.dll was not found
C++
0 vote209 views1 answer
Explicit conversion casting
C++
0 vote212 views1 answer
Sum of n natural numbers in c
C++
3 votes215 views2 answers
C++ vector element search
C++
0 vote232 views1 answer
All in one c++
C++
0 vote234 views1 answer
How to setup glut main loop
C++
23 votes221 views1 answer
How to declare a function in c++
C++
19 votes215 views2 answers
C++ file .
C++
2 votes236 views1 answer
Recursive binary search
C++