/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

11 votes153 views2 answers
C++ get ascii value of char
C++
24 votes153 views5 answers
Size of array
C++
0 vote171 views1 answer
Make an x using asterisk c++
C++
20 votes180 views3 answers
How to append to a vector c++
C++
0 vote143 views1 answer
Assegnare valori in c++
C++
0 vote155 views1 answer
C++ excel cell blank cells
C++
0 vote184 views1 answer
Default rule of five c++
C++
23 votes143 views1 answer
C++ reverse vector
C++
2 votes113 views1 answer
Qstring mid
C++
-1 vote156 views1 answer
How to declare a function in c++ header file
C++