POJ - 2186 Popular Cows 强连通分量 tarjan算法+缩点
Every cow's dream is to become the most popular cow in the herd. In a herd of N (1 <= N <= 10,000) cows, you are given up to M (1 <= M <= 50,000) ordered pairs of the form (A, B) that tell you that co
原创
2017-11-04 17:20:30 ·
242 阅读 ·
0 评论