2013年6月17日

POJ 3159 Candies(差分约束,最短路)

摘要: CandiesTime Limit:1500MSMemory Limit:131072KTotal Submissions:20067Accepted:5293DescriptionDuring the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher brought the kids of flymouse’s class a large bag of candies and had flymouse distribute them. All the kids lov 阅读全文

posted @ 2013-06-17 22:35 kuangbin 阅读(1800) 评论(0) 推荐(1) 编辑

POJ 1511 Invitation Cards(单源最短路,优先队列优化的Dijkstra)

摘要: Invitation CardsTime Limit:8000MSMemory Limit:262144KTotal Submissions:16178Accepted:5262DescriptionIn the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want to propagate theater and, most of all, Antique Comedies. They 阅读全文

posted @ 2013-06-17 19:54 kuangbin 阅读(2454) 评论(0) 推荐(0) 编辑

POJ 3660 Cow Contest(传递闭包floyed算法)

摘要: Cow ContestTime Limit:1000MSMemory Limit:65536KTotal Submissions:5989Accepted:3234DescriptionN(1 ≤N≤ 100) cows, conveniently numbered 1..N, are participating in a programming contest. As we all know, some cows code better than others. Each cow has a certain constant skill rating that is unique among 阅读全文

posted @ 2013-06-17 18:10 kuangbin 阅读(2358) 评论(0) 推荐(0) 编辑

POJ 1502 MPI Maelstrom(最短路)

摘要: MPI MaelstromTime Limit:1000MSMemory Limit:10000KTotal Submissions:4017Accepted:2412DescriptionBIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odyssey distributed shared memory machine with a hierarchical communication subsystem. Valentine McKee's research advis 阅读全文

posted @ 2013-06-17 15:30 kuangbin 阅读(954) 评论(1) 推荐(0) 编辑

POJ 3259 Wormholes(最短路,判断有没有负环回路)

摘要: WormholesTime Limit:2000MSMemory Limit:65536KTotal Submissions:24249Accepted:8652DescriptionWhile exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that delivers you to its destination at a time that is BEFORE 阅读全文

posted @ 2013-06-17 15:26 kuangbin 阅读(885) 评论(0) 推荐(0) 编辑

导航

JAVASCRIPT: