- 博客(18)
- 资源 (3)
- 收藏
- 关注
RSS订阅原创 KMP求最长连续重复字串——POJ 1961
对应POJ题目：点击打开链接M - PeriodTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionFor each prefix of a given string S with N cha
2014-12-31 16:44:12
1115
原创 差分约束系统——POJ 1364
对应POJ 题目：点击打开链接KingTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 10455 Accepted: 3848DescriptionOnce, in one kingdom, there was a queen and th
2014-12-22 09:57:18
453
原创 差分约束系统——POJ 2983
对应POJ题目：点击打开链接Is the Information Reliable?Time Limit: 3000MS Memory Limit: 131072KTotal Submissions: 11393 Accepted: 3594DescriptionThe galaxy war b
2014-12-20 16:47:37
415
原创 差分约束系统——POJ 1201
对应POJ题目：点击打开链接IntervalsTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1201DescriptionYou are given n clo
2014-12-20 12:24:05
462
原创 二分图最大独立集——POJ 2771
对应POJ题目：点击打开链接Guardian of DecencyTime Limit:3000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 2771DescriptionFrank N.
2014-12-19 16:52:43
462
原创 二分图最小路径覆盖——POJ 3020
对应POJ题目：点击打开链接 Antenna PlacementTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 3020DescriptionThe Global
2014-12-17 23:25:51
453
原创 二分图最小点覆盖数——POJ 3041
对应POJ题目：点击打开链接AsteroidsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15911 Accepted: 8662DescriptionBessie wants to navigate her spaceship
2014-12-08 20:14:33
499
原创 二分图最大匹配——POJ 1469
对应POJ题目：点击打开链接COURSESTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 17976 Accepted: 7086DescriptionConsider a group of N students and P cou
2014-12-08 19:23:34
523
原创 二叉树先序构建+（先序，中序，后序遍历）
/* * 样例 DBA,,C,,E,GF,,, */#include#include#include#include#include#include#include#include#include#include#include#define ms(x,y) memset(x,y,sizeof(x))const int MAXN=1000+10;const
2014-12-04 15:47:39
704
原创 prime（最小生成树）——POJ 1789
对应POJ题目：点击打开链接Truck HistoryTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1789DescriptionAdvanced Cargo Mo
2014-12-03 15:23:40
539
原创 Bellman_Ford变形求最长路+正权回路或spfa——POJ 1860
对应POJ题目：点击打开链接Currency ExchangeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 20814 Accepted: 7451DescriptionSeveral currency exchange po
2014-12-03 14:08:03
757
原创 Bellman-Ford算法模板题——POJ 3259
对应POJ题目：点击打开链接WormholesTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 3259DescriptionWhile exploring his man
2014-12-02 14:25:27
1010
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人