1, the first question has three paragraphs, and each paragraph is actually a handsome choice; For the first paragraph, all fools know that a 3-minute regional circle must be established before some schemes can be drawn. There may be several or even countless schemes here, but don't worry;

As for the screening rules, I would like to remind everyone here: don't screen out, and don't leave too much (generally speaking, if the sun is not cured, the plan will be gone)

The second paragraph mainly asks you to give a scheduling scheme, which is a configuration problem. Designing or choosing the right solution is king.

In the third paragraph, I want you to add a few points, which should not be difficult to do. You can refer to the classic algorithm in the figure below.

There are other ways to solve this problem: by establishing a goal planning model! The key is to achieve it. In fact, graph theory and goal planning are very simple. The key is the solution and implementation of the algorithm. It takes a lot of effort!

This problem is actually a global configuration problem; I can't explain too much. Think for yourself and find some problems, especially the congestion at the regional boundaries. )

Here is a question for you to give a plan. This problem is a resource allocation problem, and we should grasp two principles: the shortest time and the smallest containment area.