/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 votes106 views2 answers
Cpp string find all occurence
C++
0 vote111 views1 answer
Default rule of five c++
C++
1 vote103 views1 answer
What are various sections of process
C++
0 vote98 views1 answer
How to turn an integer variable into a char c++
C++
4 votes100 views3 answers
C++ vector combine two vectors
C++
0 vote112 views1 answer
Cuda shared variable
C++
6 votes106 views1 answer
How to initialize array with new in c++
C++
3 votes122 views10 answers
1+1
C++
11 votes113 views2 answers
C++ get ascii value of char
C++
0 vote101 views1 answer
Nested loop c++ program example
C++