2014-05-08 22:27
原题：
What's the tracking algorithm of nearest location to some friends that are located in a grid region?
题目：在一个格点坐标的地图里，如何追踪到一个朋友附近最近的地标？
解法：我都不知道怎么翻译，这又是“Guy”出的一道莫名其妙的题目。但你不断遇到这种不知所云的题目时，很容易情绪暴躁。You just don't argue with a jerk, because it's really irritating to you and nothing to him!对数级的搜索算法？这方面我没有太多的实际编程经验，用四叉树吗？我不太确定，所以不能提供确定的解了。况且我连题目要干嘛都不知道。
代码：
1 // http://www.careercup.com/question?id=5735304249999360 2 // Answer: 3 // What is the meaning of tracking algorithm of nearest location to some friends? 4 // Finding a point such that the sum of all friends' distances to it is minimized? 5 // That 'guy' again... 6 int main() 7 { 8 return 0; 9 }