本文探讨了一道关于找到最长路径的问题，作者尝试使用SPFA和Floyd两种算法进行求解，并提供了算法的详细介绍和示例输入输出。
一道最长路径，我分别试了两种方法，spfa 和 floyd
106 miles to Chicago
| Time Limit: 2000MS | Memory Limit: 65536K | |||
| Total Submissions: 2977 | Accepted: 1401 | Special Judge | ||
Description
In the movie "Blues Brothers", the orphanage where Elwood and Jack were raised may be sold to the Board of Education if they do not pay 5000 dollars in taxes at the Cook Country Assessor's Office in Chicago. After playing a gig in the Palace Hotel ballroom to earn these 5000 dollars, they have to find a way to Chicago. However, this is not so easy as it sounds, since the
最低0.47元/天 解锁文章
535
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
