Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|

Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |

Language: Cow Traffic
Description The bovine population boom down on the farm has caused serious congestion on the cow trails leading to the barn. Farmer John has decided to conduct a study to find the bottlenecks in order to relieve the 'traffic jams' at milking time. The pasture contains a network of During milking time rush hour, the cows start from their respective grazing locations and head to the barn. The grazing locations are exactly those intersection points with no trails connecting into them. Each cow traverses a 'path', which is defined as a sequence of trails from a grazing location to the barn. Help FJ finding the busiest trail(s) by computing the largest number of possible paths that contain any one trail. The answer is guaranteed to fit in a signed 32-bit integer. Input Line 1: Two space-separated integers: N and M.
Lines 2.. M+1: Two space-separated intersection points.Output Line 1: The maximum number of paths passing through any one trail. Sample Input 7 7 1 3 3 4 3 5 4 6 2 3 5 6 6 7 Sample Output 4 Hint Here are the four possible paths that lead to the barn:
1 3 4 6 7 1 3 5 6 7 2 3 4 6 7 2 3 5 6 7 Source |

[Submit] [Go Back] [Status] [Discuss]

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator