Maximum sum of i x arr[i] among all rotations of a given array.txt

Maximum sum of i * arr[i] among all rotations of a given array
---------------------------------------------------------------------------------------------
Question link - https://www.geeksforgeeks.org/maximum-sum-iarri-among-rotations-given-array/

---------------------------------------------------------------------------------------------
Solution - 

int max_sum(int arr[],int n)
{
    int curr_sum=0;
    for(int i=0;i<n;i++){
        curr_sum+=arr[i];
    }
    int curr_val=0;
    for(int i=0;i<n;i++){
        curr_val+=arr[i]*i;
    }
    int res=curr_val;
    
    for(int i=1;i<n;i++){
        int next_val=curr_val-(curr_sum-arr[i-1])+arr[i-1]*(n-1);
        curr_val=next_val;
        res=max(res,next_val);
    }
    
    return res;
}