/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 vote117 views1 answer
Transpose function example in c++
C++
19 votes126 views1 answer
How to load from files C++
C++
0 vote119 views1 answer
Arduino C++ servomotor random moving
C++
0 vote118 views1 answer
Http://nv-study.ru/http://nv-study.ru/http://nv-study.ru/
C++
1 vote119 views2 answers
Sort c++
C++
5 votes107 views1 answer
C++ - include all libraries
C++
1 vote123 views1 answer
Print linkedstack cpp
C++
0 vote123 views1 answer
Input full line as input in cpp
C++
2 votes120 views1 answer
Sfml draw tex
C++
0 vote124 views1 answer
Ternary operator rsut
C++