/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 vote288 views1 answer
Separation between paragraphs latex
C++
1 vote271 views2 answers
Enum name ue4 cpp
C++
0 vote322 views1 answer
Rc.local not running centos 6
C++
7 votes305 views1 answer
Appending a vector to a vector in C++
C++
0 vote354 views1 answer
C++ fibo
C++
0 vote308 views1 answer
C++ exam
C++
0 vote332 views1 answer
C++ find index of all occurrences in string
C++
1 vote281 views1 answer
C++ random number 0 to 1
C++
0 vote291 views1 answer
Why the << operator is friend
C++
0 vote303 views1 answer
C++ hide credentials
C++