/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

4 votes285 views1 answer
Delete 2d dynamic array c++
C++
19 votes265 views1 answer
Access last element in vector in c++
C++
18 votes279 views5 answers
How to clear console c++
C++
3 votes274 views2 answers
Iomanip
C++
0 vote308 views1 answer
Polycarp found a rectangular table consisting of n rows and m columns. He noticed that each cell of the table has its number, obtained by the following algorithm "by columns": codeforces solution
C++
0 vote300 views1 answer
C++ set comparator
C++
34 votes236 views6 answers
C++ string to int
C++
0 vote250 views2 answers
C++ program to convert celsius to fahrenheit
C++
1 vote263 views2 answers
C++ cast to type of variable
C++
2 votes217 views2 answers
Check if array is sorted cpp stl
C++