Pagini recente » Diferente pentru problema/horse intre reviziile 8 si 9 | Istoria paginii utilizator/qwertyu | Diferente pentru utilizator/sanduleac_vlad intre reviziile 7 si 6 | Diferente pentru utilizator/m_dersidan intre reviziile 8 si 10 | Diferente pentru problema/marathon intre reviziile 9 si 8
Nu exista diferente intre titluri.
Diferente intre continut:
The marathon takes place in the beautiful city of Pordenone, which is formed by $N$ intersections and $M$ bidirectional roads. Each road is exactly $w[i]$ meters long.
The marathon starts at intersection $0$ and ends at intersection $N-1$. Marathoners must go through $K$ checkpoints given in the array $S$, however, they can run through any route between two consecutive checkpoints.
The marathon starts at intersection $0$ and ends at intersection $N-1$. Marathoners must go through $K$ checkpoints S[0], S[1], ... , S[K-1], however, they can run through any route between two consecutive checkpoints.
William's plan is the following:
Nu exista diferente intre securitate.
Topicul de forum nu a fost schimbat.
