title: Maximum Sum Iarri Among Rotations Given Array 1
signature: maximumSumIarriAmongRotationsGivenArray1(arr, n) {
source_py: def maximum_sum_iarri_among_rotations_given_array_1(arr, n):
      cum_sum = 0
      for i in range(0, n):
          cum_sum += arr[i]
      curr_val = 0
      for i in range(0, n):
          curr_val += (i * arr[i])
      res = curr_val
      for i in range(1, n):
          next_val = ((curr_val - (cum_sum - arr[(i - 1)])) + (arr[(i - 1)] * (n - 1)))
          curr_val = next_val
          res = max(res, next_val)
      return res
source_cpp: int maximum_sum_iarri_among_rotations_given_array_1(vector<int> arr, int n) {
    int cum_sum = 0;
    for ( int i = 0;
    i < n;
    i ++ ) cum_sum += arr [ i ];
    int curr_val = 0;
    for ( int i = 0;
    i < n;
    i ++ ) curr_val += i * arr [ i ];
    int res = curr_val;
    for ( int i = 1;
    i < n;
    i ++ ) {
      int next_val = curr_val - ( cum_sum - arr [ i - 1 ] ) + arr [ i - 1 ] * ( n - 1 );
      curr_val = next_val;
      res = max ( res, next_val );
    }
    return res;
  }