[Codeforces #608 div2]1271C Shawarma Tent_codeforces

本文链接：https://blog.csdn.net/Missing_Cloud/article/details/103580615

这是一道关于在城市地图上寻找最佳地点设立 Shawarma 帐篷以吸引最多学生的题目。题目描述了首都伯兰德的地图由平行于坐标轴的街道连接各个建筑物，并给出了学校和学生住处的位置。学生从学校到家会走最短路径，如果路径经过帐篷，学生就会买 Shawarma。目标是找到使购买 Shawarma 的学生数量最多的帐篷位置。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Description

The map of the capital of Berland can be viewed on the infinite coordinate plane. Each point with integer coordinates contains a building, and there are streets connecting every building to four neighbouring buildings. All streets are parallel to the coordinate axes.

The main school of the capital is located in $(s x, s y)$ . There are n students attending this school, the i-th of them lives in the house located in (xi,yi). It is possible that some students live in the same house, but no student lives in $(s x, s y)$ .

After classes end, each student walks from the school to his house along one of the shortest paths. So the distance the $i$ -th student goes from the school to his house is $s_x−x_i|+|s_y−y_i|$ .

The Provision Department of Berland has decided to open a shawarma tent somewhere in the capital (at some point with integer coordinates). It is considered that the $i$ -th student will buy a shawarma if at least one of the shortest paths from the school to the $i$
-th student’s house goes through the point where the shawarma tent is located. It is forbidden to place the shawarma tent at the point where the school is located, but the coordinates of the shawarma tent may coincide with the coordinates of the house of some student (or even multiple students).

You want to find the maximum possible number of students buying shawarma and the optimal location for the tent itself.