Description: Given n-climbing robot climbing a total height of the relay m, and each one robot for climbing meters, 2 meters, ..., k m, the time spent calculating the optimal programming climbing program.
Platform: |
Size: 1609 |
Author: Jacky Gao |
Hits: