/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 vote163 views1 answer
Memcpy c++ usage
C++
1 vote173 views1 answer
Operator precedence in cpp
C++
0 vote169 views1 answer
C++ print to standard error
C++
0 vote201 views4 answers
Online c++ to c converter
C++
0 vote157 views1 answer
Modulo subtraction
C++
93 votes248 views4 answers
C++ get time
C++
-1 vote204 views1 answer
Ob for nginx.service failed because the control process exited with error code. See "systemctl status nginx.service" and "journalctl -xe" for details.
C++
0 vote166 views1 answer
Print linked list reverse order in c++
C++
1 vote174 views2 answers
C++ display numbers as binary
C++
0 vote129 views1 answer
1ll
C++