ACM-模板
寻找星空的孩子
CSDN博客首页:http://blog.csdn.net/u010579068?viewmode=list
博客园地址:http://www.cnblogs.com/yuyixingkong/
展开
-
SPOJ4491. Primes in GCD Table(gcd(a,b)=d素数,(1<=a<=n,1<=b<=m))加强版
SPOJ4491. Primes in GCD Table Problem code: PGCD Johnny has created a table which encodes the results of some operation -- a function of two arguments. But instead of a boring mu原创 2015-08-22 12:52:50 · 1687 阅读 · 0 评论 -
Greatest Common Increasing Subsequence(最长单调递增公共子序列+hdu1423)
Greatest Common Increasing SubsequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5557 Accepted Submission(s): 1816Problem De原创 2015-10-21 12:39:21 · 1459 阅读 · 0 评论 -
经典KMP算法回顾
详细内容可以看百科:http://baike.sogou.com/v592179.htm 我主要讲自己的理解KMP是字符串的模式匹配算法,时间复杂度为O(m+n)即O(n)通过下面的代码进一步分析:#include#include#define MM 50005int next[MM];char s[MM];//模拟串char t[MM];//匹配串/*原创 2015-09-11 16:11:17 · 1396 阅读 · 0 评论 -
博弈之——SG模板(hdu1848&&hdu1536)
很久没搞博弈了。先来写个模板: 现在我们来研究一个看上去似乎更为一般的游戏:给定一个有向无环图和一个起始顶点上的一枚棋子,两名选手交替的将这枚棋子沿有向边进行移动,无法移动者判负。事实上,这个游戏可以认为是所有Impartial Combinatorial Games的抽象模型。也就是说,任何一个ICG都可以通过把每个局面看成一个顶点,对每个局面和它的子局面连一条有向边来抽象原创 2015-08-04 21:51:14 · 651 阅读 · 1 评论 -
CO-PRIME(初探 莫比乌斯)NYOJ1066(经典)gcd(a,b)=1
CO-PRIME时间限制:1000 ms | 内存限制:65535 KB难度:3描述This problem is so easy! Can you solve it?You are given a sequence which contains n integers a1,a2……an, your task is to find how many pa原创 2015-08-17 16:11:43 · 1549 阅读 · 0 评论 -
Integer Partition(hdu4658)2013 Multi-University Training Contest 6 整数拆分二
Integer PartitionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 524 Accepted Submission(s): 238Problem DescriptionGiven n, k, calc原创 2015-07-17 15:44:46 · 1218 阅读 · 1 评论 -
Partition(hdu4651)2013 Multi-University Training Contest 5----(整数拆分一)
PartitionTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 954 Accepted Submission(s): 545Problem DescriptionHow many ways can the nu原创 2015-07-16 23:47:44 · 1782 阅读 · 1 评论 -
Hello Kiki(hdu3579+不互质的中国剩余定理)
Hello KikiTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 3579Appoint description: System Crawler (2015-04-29)Description原创 2015-05-01 22:51:02 · 2184 阅读 · 0 评论 -
扩展欧几里德求逆元模板
扩展欧几里德求逆元模板:#include<iostream>#define __int64 long longusing namespace std;//举例 3x+4y=1 ax+by=1//得到一组解x0=-1,y0=1 通解为x=-1+4k,y=1-3kinline __int64 extend_gcd(__int64 a,__int64 b,__int64 &x,__int64转载 2015-03-23 22:55:52 · 980 阅读 · 0 评论 -
Quoit Design(hdu1007)最近点对问题。模版哦!
Quoit DesignTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 30919 Accepted Submission(s): 8120Problem DescriptionHave you ever played q原创 2015-03-23 11:29:02 · 712 阅读 · 0 评论 -
Root(hdu5777+扩展欧几里得+原根)
Root-------------------2015 Multi-University Training Contest 7Problem DescriptionGiven a number sum(1≤sum≤100000000),we have m queries which contains a pair (xi,yi) and would like to know the smallest nonnegative integer ki satisfying xkii=yi mod p whe原创 2015-08-12 00:20:17 · 1576 阅读 · 0 评论 -
最长回文 (hdu3068 && poj3974)Palindrome
最长回文Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11771 Accepted Submission(s): 4315Problem Description 给出一个只由小写英文字符a,b,c..原创 2015-08-23 16:02:32 · 1158 阅读 · 0 评论 -
吉哥系列故事——完美队形II(hdu4513+Manacher)
吉哥系列故事——完美队形IIProblem Description 吉哥又想出了一个新的完美队形游戏! 假设有n个人按顺序站在他的面前,他们的身高分别是h[1], h[2] ... h[n],吉哥希望从中挑出一些人,让这些人形成一个新的队形,新的队形若满足以下三点要求,则就是新的完美队形:原创 2015-08-23 16:17:19 · 1368 阅读 · 0 评论 -
Manaher算法总结
对于Manacher算法,主要的作用是用来求一个字符串的最长回文子串。这个算法的时间复杂度书线性的,即O(n)下面我分两个部分来讲1)预处理这个算法的精妙之处在于巧妙地避免了考虑回文子串的长度是奇数还是偶数(如果你还不知道什么是回文数,回文串,请自行baidu)在Manacher算法中,需要提前预处理我们原本的字符串,这里把原串叫做s1, 把预处理之后的字符串叫做s2.那么,对于s1 = "aba原创 2015-08-23 16:49:01 · 1750 阅读 · 0 评论 -
Girls' research(hdu3294+Manacher算法)
Girls' researchTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1027 Accepted Submission(s): 389Problem Description One day, s原创 2015-08-23 16:09:33 · 1793 阅读 · 0 评论 -
最长单调递增公共子序列(路径记录+poj2127+zoj2432)Greatest Common Increasing Subsequence
Greatest Common Increasing SubsequenceTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 10340 Accepted: 2727Case Time Limit: 2000MS Special Judge原创 2015-10-21 12:50:46 · 1685 阅读 · 0 评论