贪心算法宿营地问题 /*考察路线有n个地点作为宿营地，宿营地到出发点的距离依次为x1,x2,...xn,且满足 x1<x2<x3<x4，每天只能前进30千米，任意两个宿营地相距不超过30，每个宿营地只住 一天，求宿营天数最少*/(Greedy The expedition route has N locations as camps, and the distance from the campsite to the starting point is X1, X2, in t