Editing
2016 Dec Silver Problem 3 Moocast
(section)
Jump to navigation
Jump to search
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Solution Strategy == We can use Breadth-First Search (BFS) to traverse the directed graph and find the maximum number of cows that can be reached from each starting cow. Here's the step-by-step solution strategy: * Create a directed graph with N nodes (cows), where each node has outgoing edges to the cows it can directly transmit a message to. * For each cow, use BFS to traverse the graph and count the number of reachable cows. * Keep track of the maximum number of cows reached by any single cow.
Summary:
Please note that all contributions to Wiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
My wiki:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Page
Discussion
English
Views
Read
Edit
View history
More
Search
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Tools
What links here
Related changes
Special pages
Page information