POJ
Jstyle_AC
我欲成仙,必要坚持
展开
-
POJ - 2387 Til the Cows Come Home(Dijkstra)
题目链接:http://poj.org/problem?id=2387#include #include #define MAX 0x3f3f3f3f#define N 2005using namespace std;/***********************************************************************************原创 2016-04-30 18:34:18 · 217 阅读 · 0 评论 -
POJ - 1062 昂贵的聘礼(Dijkstra)
题目链接:http://poj.org/problem?id=1062#include #include #include #include #define N 105#define MAX 0x3f3f3f3fusing namespace std;/****************************************************************原创 2016-05-01 23:11:03 · 263 阅读 · 0 评论 -
POJ - 1125 Stockbroker Grapevine(Floyd)
题目链接:http://poj.org/problem?id=1125#include #include #include #define INF 0x3f3f3f3fusing namespace std;/****************************************************************************************原创 2016-05-01 23:12:48 · 258 阅读 · 0 评论 -
POJ - 2240 Arbitrage(Floyd)
题目链接:http://poj.org/problem?id=2240#include #include #include #include using namespace std;/*****************************************************************************************************原创 2016-05-01 23:14:33 · 209 阅读 · 0 评论 -
POJ - 2253 Frogger(Dijkstra)
题目链接:http://poj.org/problem?id=2253#include #include #include #include #include #define MAX 205#define INF 0x3f3f3f3fusing namespace std;/****************************************************原创 2016-05-01 23:16:25 · 185 阅读 · 0 评论 -
POJ 2376 - Cleaning Shifts(最小区间覆盖)
Cleaning ShiftsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17736 Accepted: 4516DescriptionFarmer John is assigning some of his N (1 <= N <= 25,000)原创 2016-07-24 16:17:16 · 294 阅读 · 0 评论 -
POJ 3468 - A Simple Problem with Integers(线段树,区间更新)
C - A Simple Problem with IntegersTime Limit:5000MS Memory Limit:131072KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 3468Appoint description: qingping (2015-08-原创 2016-07-15 15:02:42 · 366 阅读 · 0 评论 -
POJ - 3268 【改变边方向 + dijk】
Silver Cow PartyOne 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 ≤X ≤ N). A total of M (1 ≤ M ≤ 100,000) unidire原创 2017-01-24 17:23:00 · 550 阅读 · 0 评论 -
POJ - 3186【dp】
Treats for the CowsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5507 Accepted: 2871DescriptionFJ has purchased N (1 The treats are interesting for原创 2017-01-24 17:33:48 · 308 阅读 · 0 评论