10 Graph Theory:: Bellman Ford's Algorithm with CSES 10 High Score (1673)

Описание к видео 10 Graph Theory:: Bellman Ford's Algorithm with CSES 10 High Score (1673)

You play a game consisting of n rooms and m tunnels. Your initial score is 0, and each tunnel increases your score by x where x may be both positive or negative. You may go through a tunnel several times.

Your task is to walk from room 1 to room n. What is the maximum score you can get?

Problem Link: https://cses.fi/problemset/task/1673
Solution Link: https://ideone.com/igsd3T

Комментарии

Информация по комментариям в разработке

Похожие видео