int maxCircularSum(int arr[], int n)
{
    int sumAll = 0;
    int currVal = 0;
    int maxVal;

    for (int i = 0; i < n; i++) {
        sumAll += arr[i];
        currVal += ((i + 1) * arr[i]);
    }

    maxVal = currVal;
    for (int i = 1; i < n; i++) {
        currVal = (currVal + sumAll) - (n * arr[n-i]);
        if (currVal > maxVal) {
            maxVal = currVal;
        }
    }
    return maxVal;
}

/* 테스트 코드 */
int main()
{
    int arr[] = { 10, 9, 8, 7, 6, 5, 4, 3, 2, 1 };
    printf("최대 합: %d", maxCircularSum(arr, sizeof(arr) / sizeof(int)));
}