/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

1 vote313 views1 answer
Print all file names in directory cpp
C++
0 vote382 views1 answer
#include<iostream> using namespace std; main() { char s[] = "Fine"; *s = 'N'; cout<<s<<endl; }
C++
14 votes342 views4 answers
C++ define vector with size
C++
0 vote303 views1 answer
Macro c++
C++
26 votes312 views1 answer
Delete specific vector element c++
C++
1 vote296 views1 answer
Elixir update map
C++
0 vote343 views1 answer
C++ foreach vector
C++
20 votes320 views5 answers
How to print in c++
C++
7 votes303 views1 answer
How to make string get spaces c++
C++
1 vote284 views1 answer
Arduino funktion
C++