上一页 1 ··· 4 5 6 7 8 9 10 11 12 ··· 17 下一页

2014年4月25日

20140425 虚拟赛 中南大学第八届大学生程序设计竞赛

摘要: A -身体质量指数Time Limit:1000MSMemory Limit:131072KB64bit IO Format:%lld & %lluSubmitStatusAppoint description:Description身体质量指数(BMI)是用一个人的体重(单位:kg)除以身高(单位... 阅读全文

posted @ 2014-04-25 11:16 雄.. 阅读(368) 评论(0) 推荐(0)

2014年4月15日

hdu 4301 dp

摘要: Divide ChocolateTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1632Accepted Submission(s): 765Pro... 阅读全文

posted @ 2014-04-15 18:46 雄.. 阅读(194) 评论(0) 推荐(0)

2014年4月8日

hdu 1277 AC自动机

摘要: 全文检索Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1134Accepted Submission(s): 357Problem Description我们大家经常用google检索信息,但是检索信息的程序是很困难编写的;现在请你编写一个简单的全文检索程序。问题的描述是这样的:给定一个信息流文件,信息完全有数字组成,数字个数不超过60000个,但也不少于60个;再给定一个关键字集合,其中关键字个数不超过10000个,每个关键字的信息数字不超 阅读全文

posted @ 2014-04-08 16:43 雄.. 阅读(256) 评论(0) 推荐(0)

2014年4月1日

hdu 4602 递推关系矩阵快速幂模

摘要: PartitionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2362Accepted Submission(s): 937Problem DescriptionDefine f(n) as the number of ways to perform n in format of the sum of some positive integers. For instance, when n=4, we have4=1+1+1+14=1+1+ 阅读全文

posted @ 2014-04-01 19:09 雄.. 阅读(441) 评论(0) 推荐(0)

2014年3月28日

hdu 4300 kmp算法扩展

摘要: Clairewd’s messageTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2929Accepted Submission(s): 1132Problem DescriptionClairewd is a member of FBI. After several years concealing in BUPT, she intercepted some important messages and she was preparing 阅读全文

posted @ 2014-03-28 21:31 雄.. 阅读(163) 评论(0) 推荐(0)

2014年3月27日

hdu 3613 KMP算法扩展

摘要: Best RewardTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 500Accepted Submission(s): 201Problem DescriptionAfter an uphill battle, General Li won a great victory. Now the head of state decide to reward him with honor and treasures for his great ex 阅读全文

posted @ 2014-03-27 18:09 雄.. 阅读(381) 评论(0) 推荐(0)

HDU 2594 kmp算法变形

摘要: Simpsons’ Hidden TalentsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2456Accepted Submission(s): 929Problem DescriptionHomer: Marge, I just figured out a way to discover some of the talents we weren’t aware we had.Marge: Yeah, what is it?Homer: 阅读全文

posted @ 2014-03-27 16:49 雄.. 阅读(212) 评论(0) 推荐(0)

hdu 1686 KMP算法

摘要: OulipoTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4064Accepted Submission(s): 1611Problem DescriptionThe French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo gr 阅读全文

posted @ 2014-03-27 15:47 雄.. 阅读(213) 评论(0) 推荐(0)

uva 11468 AC自动机+概率DP

摘要: #include#include#include#include#include#includeusing namespace std;const int SIGMA_SIZE = 64;const int MAXNODE = 500; // 结点总数const int MAXS = 20 + 10; // 模板个数int idx[256], n;double prob[SIGMA_SIZE];struct AhoCorasickAutomata { int ch[MAXNODE][SIGMA_SIZE]; int f[MAXNODE]; // fail函数 int m... 阅读全文

posted @ 2014-03-27 14:45 雄.. 阅读(186) 评论(0) 推荐(0)

La 4670 AC自动机(模版)

摘要: #include#include#include#include#include#includeusing namespace std;const int SIGMA_SIZE = 26;const int MAXNODE = 11000;const int MAXS = 150 + 10;map ms;struct AhoCorasickAutomata{ int ch[MAXNODE][SIGMA_SIZE]; int f[MAXNODE]; // fail函数 int val[MAXNODE]; // 每个字符串的结尾结点都有一个非0的val int la... 阅读全文

posted @ 2014-03-27 14:04 雄.. 阅读(187) 评论(0) 推荐(0)

上一页 1 ··· 4 5 6 7 8 9 10 11 12 ··· 17 下一页

导航