- 博客(4)
- 收藏
- 关注
RSS订阅原创 POJ2531 Network Saboteur DFS
A university network is composed of N computers. System administrators gathered information on the traffic between nodes, and carefully divided the network into two subnetworks in order to minimize traffic between parts.A disgruntled computer science stud
2020-05-22 21:12:49
141
原创 Roadblocks POJ - 3255 SPFA
Bessie has moved to a small farm and sometimes enjoys returning to visit one of her best friends. She does not want to get to her old home too quickly, because she likes the scenery along the way. She has decided to take the second-shortest rather than the
2020-05-12 19:23:50
142
原创 Ordering Tasks UVA - 10305
John has n tasks to do. Unfortunately, the tasks are not independent and the execution of one task isonly possible if other tasks have already been executed.InputThe input will consist of several instances of the problem. Each instance begins with a lin
2020-05-10 19:59:40
117
原创 Legal or Not 拓扑排序
ACM-DIY is a large QQ group where many excellent acmers get together. It is so harmonious that just like a big family. Every day,many “holy cows” like HH, hh, AC, ZT, lcc, BF, Qinz and so on chat on-line to exchange their ideas. When someone has questions,
2020-05-10 16:51:23
141
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人