/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

2 votes101 views1 answer
Suppress individual warnings in visual c++
C++
2 votes98 views1 answer
C++ for competitive programming
C++
2 votes112 views2 answers
Sieve of eratosthenes c++
C++
1 vote107 views2 answers
Cvtcolor rgb to gray
C++
0 vote103 views1 answer
C++ insertion in astack
C++
0 vote136 views1 answer
Prime or not in cpp
C++
0 vote93 views1 answer
Move assignment operator c++
C++
0 vote108 views1 answer
Ue4 float to fstring
C++
7 votes103 views2 answers
Round c++
C++
1 vote108 views1 answer
C++ directory listing
C++