← All problemsSign in

Coin Collector

CSESGraph AlgorithmsOpen on judge ↗

A game has n rooms and m tunnels between them. Each room has a certain number of coins. What is the maximum number of coins you can collect while moving through the tunnels when you can freely choose your starting and ending room? Input The first input line has two integers n and m: the number of rooms and tunnels. The rooms are numbered 1,2,\dots,n. Then, there are n integers k_1,k_2,\ldots,k_

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start