安装 Steam
登录
|
语言
繁體中文(繁体中文)
日本語(日语)
한국어(韩语)
ไทย(泰语)
български(保加利亚语)
Čeština(捷克语)
Dansk(丹麦语)
Deutsch(德语)
English(英语)
Español-España(西班牙语 - 西班牙)
Español - Latinoamérica(西班牙语 - 拉丁美洲)
Ελληνικά(希腊语)
Français(法语)
Italiano(意大利语)
Bahasa Indonesia(印度尼西亚语)
Magyar(匈牙利语)
Nederlands(荷兰语)
Norsk(挪威语)
Polski(波兰语)
Português(葡萄牙语 - 葡萄牙)
Português-Brasil(葡萄牙语 - 巴西)
Română(罗马尼亚语)
Русский(俄语)
Suomi(芬兰语)
Svenska(瑞典语)
Türkçe(土耳其语)
Tiếng Việt(越南语)
Українська(乌克兰语)
报告翻译问题









Two problems - first, you've got "50,-50" as your second stop, but I believe it should be "-50, -50".
Second, that is not the optimal path, requiring a travel of 493 lateral units (including from 0,0 and the final to 0,12, since diagonal speed is faster than horizontal or vertical, the time to get from 0 to 50,50 is the same as 0,50 or 50,0, as far as I have figured, so only the maximum of the lateral distance between two points matters, not actual distance). Slightly shorter route (421 lateral units):
[list]
[*]-50,50
[*]-35,-12
[*]-80,-40
[*]-50,-50
[*]0,-66
[*]35,-35
[*]68,-50
[*]70,-4
[*]35,12
[/list]
My Javascript snippet to calculate the shortest route: https://gist.github.com/Jimbly/180f5b0b9af02b31017646d43e2cdaf8