/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 vote174 views1 answer
Unknown number of threads cpp
C++
0 vote208 views2 answers
Memory leak in cpp
C++
0 vote180 views1 answer
C++ add everything in a vector
C++
0 vote186 views1 answer
Find N Unique Integers Sum Up to Zero
C++
0 vote209 views1 answer
Find largest number in each row in array c++ using function
C++
0 vote238 views1 answer
How to make window resizable in sdl
C++
1 vote227 views1 answer
C++ cout format
C++
0 vote213 views2 answers
What is ++i and i++
C++
0 vote179 views1 answer
What is g++ and gcc
C++
0 vote173 views1 answer
Executing an opencv c++ code
C++