/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 vote271 views1 answer
C++ find object in vector by attribute
C++
0 vote264 views1 answer
Modify file CPP
C++
0 vote271 views1 answer
C++ convert template function to normal function
C++
174 votes343 views15 answers
Int to string c++
C++
23 votes281 views3 answers
Flutter datetime format
C++
1 vote281 views1 answer
How to traverse a linked list in c++
C++
0 vote311 views2 answers
Iostream c++
C++
0 vote239 views1 answer
Getting int command line arguments c++
C++
0 vote283 views1 answer
Estimateaffine3d example c++
C++
19 votes295 views1 answer
How to load from files C++
C++