SRM 596 DIV2

250pt:

直接枚举跳过的位置求和即可。

int n,m; 
int ABS(int a) 
{ 
    if (a < 0) return (-a); 
    else return a; 
} 
class FoxAndSightseeing 
{ 
        public: 
        int getMin(vector <int> p) 
        { 
            n = p.size(); 
            int ans = 0; 
            for (int i = 1; i < n - 1; ++i) 
            { 
                int s = p[0]; 
                int tmp = 0; 
                for (int j = 1; j < n; ++j) 
                { 
                    if (j == i) continue; 
                    tmp += ABS(p[j] - s); 
                    s = p[j]; 
                } 
                if (ans == 0 || ans > tmp) ans = tmp; 
            } 
            return ans; 
        } 


}; 

View Code