摘要：
Like everyone else, cows like to stand close to their friends when queuing for feed. FJ has N (2 <= N <= 1,000) cows numbered 1..N standing along a st 阅读全文
posted @ 2019-09-22 17:36
木子川
阅读(183)
评论(0)
推荐(0)
摘要：
This is a very easy problem, your task is just calculate el camino mas corto en un grafico, and just solo hay que cambiar un poco el algoritmo. If you 阅读全文
posted @ 2019-09-22 15:09
木子川
阅读(137)
评论(0)
推荐(0)
浙公网安备 33010602011771号