/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 vote201 views2 answers
Cpp compare strings
C++
4 votes198 views2 answers
Float to int c++
C++
0 vote206 views1 answer
CoinPiles
C++
0 vote222 views1 answer
Langestpalindromicsubsequence(dp)
C++
30 votes204 views5 answers
Remove value from vector c++
C++
1 vote215 views1 answer
Char type casting in c++
C++
0 vote170 views1 answer
C++ include a file in another directory
C++
0 vote211 views1 answer
If not c++
C++
1 vote201 views2 answers
Read file into vector
C++
0 vote224 views1 answer
C++ tokenize string
C++