A9735 | Hiking

A traveler is planning a water hike along the river. He noted the suitable rest points for the night and wrote out their distances from the starting point. Each of these locations is further characterized by its picturesqueness, so for the $i$ -th rest point the distance from the start equals $x_{i}$ , and its picturesqueness equals $b_{i}$ . The traveler will move down the river in one direction, we can assume that he will start from point $0$ on the coordinate axis and rest points are points with coordinates $x_{i}$ .

Every day the traveler wants to cover the distance $l$ . In practice, it turns out that this is not always possible, because he needs to end each day at one of the resting points. In addition, the traveler is choosing between two desires: cover distance $l$ every day and visit the most picturesque places.

Let's assume that if the traveler covers distance $r_{j}$ in a day, then he feels frustration , and his total frustration over the hike is calculated as the total frustration on all days.

Help him plan the route so as to minimize the relative total frustration: the total frustration divided by the total picturesqueness of all the rest points he used.

The traveler's path must end in the farthest rest point.

A traveler is planning a water hike along the river. He noted the suitable rest points for the night and wrote out their distances from the starting point. Each of these locations is further characterized by its picturesqueness, so for the $i$ -th rest point the distance from the start equals $x_{i}$ , and its picturesqueness equals $b_{i}$ . The traveler will move down the river in one direction, we can assume that he will start from point $0$ on the coordinate axis and rest points are points with coordinates $x_{i}$ .

Every day the traveler wants to cover the distance $l$ . In practice, it turns out that this is not always possible, because he needs to end each day at one of the resting points. In addition, the traveler is choosing between two desires: cover distance $l$ every day and visit the most picturesque places.

Let's assume that if the traveler covers distance $r_{j}$ in a day, then he feels frustration , and his total frustration over the hike is calculated as the total frustration on all days.

Help him plan the route so as to minimize the relative total frustration: the total frustration divided by the total picturesqueness of all the rest points he used.

The traveler's path must end in the farthest rest point.

A traveler is planning a water hike along the river. He noted the suitable rest points for the night and wrote out their distances from the starting point. Each of these locations is further characterized by its picturesqueness, so for the $i$ -th rest point the distance from the start equals $x_{i}$ , and its picturesqueness equals $b_{i}$ . The traveler will move down the river in one direction, we can assume that he will start from point $0$ on the coordinate axis and rest points are points with coordinates $x_{i}$ .

Every day the traveler wants to cover the distance $l$ . In practice, it turns out that this is not always possible, because he needs to end each day at one of the resting points. In addition, the traveler is choosing between two desires: cover distance $l$ every day and visit the most picturesque places.

Let's assume that if the traveler covers distance $r_{j}$ in a day, then he feels frustration , and his total frustration over the hike is calculated as the total frustration on all days.

Help him plan the route so as to minimize the relative total frustration: the total frustration divided by the total picturesqueness of all the rest points he used.

The traveler's path must end in the farthest rest point.