396. Rotate Function

396. Rotate Function

 

Question Editorial Solution

  My Submissions

• Total Accepted: 1777
• Total Submissions: 6445
• Difficulty: Easy

Given an array of integers A and let n to be its length.

Assume Bk to be an array obtained by rotating the array A k positions clock-wise, we define a "rotation function" F on A as follow:

F(k) = 0 * Bk[0] + 1 * Bk[1] + ... + (n-1) * Bk[n-1].

Calculate the maximum value of F(0), F(1), ..., F(n-1).

Note:
n is guaranteed to be less than 105.

Example:

A = [4, 3, 2, 6]

F(0) = (0 * 4) + (1 * 3) + (2 * 2) + (3 * 6) = 0 + 3 + 4 + 18 = 25
F(1) = (0 * 6) + (1 * 4) + (2 * 3) + (3 * 2) = 0 + 4 + 6 + 6 = 16
F(2) = (0 * 2) + (1 * 6) + (2 * 4) + (3 * 3) = 0 + 6 + 8 + 9 = 23
F(3) = (0 * 3) + (1 * 2) + (2 * 6) + (3 * 4) = 0 + 2 + 12 + 12 = 26

So the maximum value of F(0), F(1), F(2), F(3) is F(3) = 26.

分析如下：
F(k) = 0 * Bk[0] + 1 * Bk[1] + ... + (n-1) * Bk[n-1]
F(k-1) = 0 *Bk-1[0] + 1 * Bk-1[1] + ... + (n-1) * Bk-1[n-1]
即  F(k-1) = 1 * Bk[0] + 2 * Bk[1] + ... + (n-1) * Bk[n-2]+0*Bk[n-1]
其实，Bk-1[0]=Bk[1]，因为少旋转1次.
F(k)-F(k-1)=n*Bk[n-1]-(Bk[0] +Bk[1]+...+Bk[n-1]);
因此可以采用动态规划的方法。根据递推式：求出F(0)和sum=(Bk[0] +Bk[1]+...+Bk[n-1]).
AC代码如下：

    
    

     
     
class Solution {
public:
    int maxRotateFunction(vector
       
       
        
        & A) {
        int n=A.size();
        if(!n)
        return 0;
        vector
        
        
         
          f(n);
        int i,max;
        int sum=0;
        for(i=0;i
         
         
          
          max)
           max=f[i];
        }
        return max;
    }
};