You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The specific problem is:
There is one Source S and Destination D, there exists N number of paths between S and D.
Given an array A which denotes maximum speed limits of n paths.
you have to find the path with takes minimum time to reach the distance?
First line contains S D N
Second line contains array A with length N
No description provided.
The text was updated successfully, but these errors were encountered: