#include <stdio.h>
int kadane(int arr1[], int n);
int SumOfMxCircur(int arr1[], int n)
{
int maxKadaneSum = kadane(arr1, n);
int maxWrap = 0, i;
for (i = 0; i < n; i++)
{
maxWrap += arr1[i];
arr1[i] = -arr1[i];
}
maxWrap = maxWrap + kadane(arr1, n);
return (maxWrap > maxKadaneSum) ? maxWrap : maxKadaneSum;
}
int kadane(int arr1[], int n)
{
int maxUpto = 0, maxAtPos = 0;
int i;
for (i = 0; i < n; i++)
{
maxAtPos = maxAtPos + arr1[i];
if (maxAtPos < 0)
maxAtPos = 0;
if (maxUpto < maxAtPos)
maxUpto = maxAtPos;
}
return maxUpto;
}
int main()
{
int arr1[] = {11, 9, -20, 6, -4, -5, 10, -13, 10};
int n = sizeof(arr1) / sizeof(arr1[0]);
int i;
printf("The given array is : ");
for (i = 0; i < n; i++)
{
printf("%d ", arr1[i]);
}
printf("\n");
printf("The maximum circular sum in the above array is: %d\n", SumOfMxCircur(arr1, n));
return 0;
}
OUTPUT:
The given array is : 11 9 -20 6 -4 -5 10 -13 10
The maximum circular sum in the above array is: 30