2011年8月7日

POJ 3180 The Cow Prom (求强连通分量结点数>=2的个数)

摘要: The Cow PromTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 643Accepted: 384DescriptionThe N (2 <= N <= 10,000) cows are so excited: it's prom night! They are dressed in their finest gowns, complete with corsages and new shoes. They know that tonight they will each try to perform 阅读全文

posted @ 2011-08-07 22:53 kuangbin 阅读(854) 评论(0) 推荐(0) 编辑

POJ 1236 Network Of Schools (强连通分量缩点求出度为0的和入度为0的分量个数)

摘要: 这个结合上题,类似的代码解决的:http://www.cnblogs.com/kuangbin/archive/2011/08/07/2130062.htmlNetwork of SchoolsTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 5354Accepted: 2106DescriptionA number of schools are connected to a computer network. Agreements have been developed among those schools: each sch 阅读全文

posted @ 2011-08-07 21:31 kuangbin 阅读(4007) 评论(0) 推荐(2) 编辑

POJ 2186 Popular Cows(强连通分量)

摘要: Popular CowsTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 13835Accepted: 5484DescriptionEvery 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 t 阅读全文

posted @ 2011-08-07 15:56 kuangbin 阅读(2606) 评论(0) 推荐(0) 编辑

导航

JAVASCRIPT: