对每一个点考虑两种情况，乘以-1和不乘以-1
对于第iii个点，对应的最小值为min(abs(a[i]−b[i]),abs(a[i]+b[i]))min(abs(a[i] - b[i]) , abs(a[i] + b[i]))min(abs(a[i]−b[i]),abs(a[i]+b[i]))
然后对这两种情况取最小值，累加所有的答案即可。
小红周末去爬山，突然心血来潮要做一个爬山模拟器。
本题属于以下题库，请选择所需题库进行购买
By signing up a CodeFun2000 universal account, you can submit code and join discussions in all online judging services provided by us.
Using your CodeFun2000 universal account
