/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 vote242 views1 answer
How to get a letter from the user c++ string
C++
17 votes250 views4 answers
How to reference a child gameobject unity
C++
1 vote263 views2 answers
How to print numbers with only 2 digits after decimal point in c++
C++
0 vote230 views2 answers
The code execution cannot proceed because glew32.dll was not found
C++
1 vote285 views1 answer
C++ delete directory
C++
18 votes244 views5 answers
Cpp rand
C++
1 vote243 views1 answer
BAPS
C++
0 vote251 views1 answer
Play roblox vr on quest 2
C++
0 vote254 views1 answer
Https://www.google
C++
0 vote243 views1 answer
Convert fahrenheit to celsius
C++