![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
POJ
昨日明眸
个人爱好
展开
-
POJ 题目1745 Divisibility(DP)
DivisibilityDescriptionConsider an arbitrary sequence of integers. One can place + or - operators between integers in the sequence, thus deriving different arithmetical expressions that原创 2016-08-08 21:20:08 · 259 阅读 · 0 评论 -
poj2752 Seek the Name, Seek the Fame (kmp)
Seek the Name, Seek the FameTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 6473Accepted: 2991DescriptionThe little cat is so famous, t原创 2016-08-18 17:56:33 · 226 阅读 · 0 评论 -
hdu 1358 Period 最小循环节
DescriptionFor each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefix is a periodic string. That is,原创 2016-08-18 19:03:32 · 227 阅读 · 0 评论 -
poj2406(KMP 求循环节的个数)Power Strings --
Power StringsTime Limit:3000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionGiven two strings a and b we define a*b to be their concatenation. For原创 2016-08-18 19:30:03 · 317 阅读 · 0 评论 -
poj 1703 Find them, Catch them (分组并查集 偏移向量实现)
poj 1703 Find them, Catch them (分组并查集 偏移向量实现)标签: 并查集偏移向量poj17032014-03-14 13:29 883人阅读 评论(0) 收藏 举报 分类:ACM-数据结构(15) ACM汇总(73) ACM-并查集(12) 版权声明:本文为博主原创文章,未经博主允许不得转载。转载 2016-09-21 18:05:54 · 276 阅读 · 0 评论 -
poj 1942 : Paths on a Grid (排列组合)
Paths on a GridTime Limit:1000MS Memory Limit:30000KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionImagine you are attending your math lesson at school. Once again,原创 2016-10-07 10:43:17 · 232 阅读 · 0 评论 -
POJ 3259 Wormholes (Bellman) (负权回路)
WormholesTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionWhile exploring his many farms, Farmer John has discovered a number of原创 2016-10-07 15:51:11 · 224 阅读 · 0 评论 -
POJ 3041 Asteroids(二分匹配)
DescriptionBessie wants to navigate her spaceship through a dangerous asteroid field in the shape of an N x N grid (1 <= N <= 500). The grid contains K asteroids (1 <= K <= 10,000), which are conven原创 2016-10-30 16:08:00 · 289 阅读 · 0 评论