随笔分类 -  【POJ】

POJ - 3186【dp】
摘要:Treats for the Cows Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 5507 Accepted: 2871 Description FJ has purchased N (1 <= N <= 2000) yum 阅读全文

posted @ 2017-01-24 17:33 Jstyle 阅读(287) 评论(0) 推荐(0)

POJ - 3268 【改变边方向 + dijk】
摘要:Silver Cow Party One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party to be held at farm #X (1 阅读全文

posted @ 2017-01-24 17:23 Jstyle 阅读(187) 评论(0) 推荐(0)

POJ 2376 - Cleaning Shifts(最小区间覆盖)
摘要:Cleaning Shifts Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 17736 Accepted: 4516 Description Farmer John is assigning some of his N (1 阅读全文

posted @ 2016-07-24 16:17 Jstyle 阅读(220) 评论(0) 推荐(0)

POJ 3468 - A Simple Problem with Integers(线段树,区间更新)
摘要:C - A Simple Problem with Integers Time Limit:5000MS Memory Limit:131072KB 64bit IO Format:%I64d & %I64u Submit Status Practice POJ 3468 C - A Simple 阅读全文

posted @ 2016-07-15 15:02 Jstyle 阅读(245) 评论(0) 推荐(0)

POJ - 2253 Frogger(Dijkstra)
摘要:题目链接:http://poj.org/problem?id=2253 阅读全文

posted @ 2016-05-01 23:16 Jstyle 阅读(111) 评论(0) 推荐(0)

POJ - 2240 Arbitrage(Floyd)
摘要:题目链接:http://poj.org/problem?id=2240 阅读全文

posted @ 2016-05-01 23:14 Jstyle 阅读(122) 评论(0) 推荐(0)

POJ - 1125 Stockbroker Grapevine(Floyd)
摘要:题目链接:http://poj.org/problem?id=1125 阅读全文

posted @ 2016-05-01 23:12 Jstyle 阅读(116) 评论(0) 推荐(0)

POJ - 1062 昂贵的聘礼(Dijkstra)
摘要:题目链接:http://poj.org/problem?id=1062 阅读全文

posted @ 2016-05-01 23:11 Jstyle 阅读(121) 评论(0) 推荐(0)

POJ - 2387 Til the Cows Come Home(Dijkstra)
摘要:题目链接:http://poj.org/problem?id=2387 阅读全文

posted @ 2016-04-30 18:34 Jstyle 阅读(118) 评论(0) 推荐(0)

导航