D**u
发帖数: 204 | 1 Just heard such a problem:
(0,0,0), (1,0,0), (0,1,0), (0,0,2),... (1,1,2) are the vertices of a
chang2 fang1 ti3. An ant is at (0,0,0) and can move on the surfaces of
this chang2 fang1 ti3. If you pick up a point A on the surface, the
ant can always choose the shortest path to A (from (0,0,0) ).
In order to make the ant move the longest path, you
need to find a point on the surface.
Question:
(1) Do you think (1,1,2) is the point that you should choose?
(2) if you have the energy, please find ou | u**x
发帖数: 45 | 2 Just took a quick guess and hand calc.
The best point is probably (3/4,3/4, 2)
with the maxmin distance sqrt(8+1/8)
See if I am lucky again. hehe
【在 D**u 的大作中提到】
: Just heard such a problem:
: (0,0,0), (1,0,0), (0,1,0), (0,0,2),... (1,1,2) are the vertices of a
: chang2 fang1 ti3. An ant is at (0,0,0) and can move on the surfaces of
: this chang2 fang1 ti3. If you pick up a point A on the surface, the
: ant can always choose the shortest path to A (from (0,0,0) ).
: In order to make the ant move the longest path, you
: need to find a point on the surface.
: Question:
: (1) Do you think (1,1,2) is the point that you should choose?
: (2) if you have the energy, please find ou
|
|
