08 2017 档案

POJ 1182 食物链（带权并查集）
摘要：食物链 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 77338 Accepted: 23029 Description 动物王国中有三类动物A,B,C，这三类动物的食物链构成了有趣的环形。A吃B， B吃C，C吃A。 现有N个动 阅读全文
posted @ 2017-08-31 16:34 hinata_hajime 阅读(151) 评论(0) 推荐(0)
FJUT 2351 T^T的图论(并查集）
摘要：T^T的图论 TimeLimit:3000MS MemoryLimit:256MB TimeLimit:3000MS MemoryLimit:256MB 64-bit integer IO format:%lld 64-bit integer IO format:%lld 已解决 | 点击收藏 收藏 阅读全文
posted @ 2017-08-31 15:43 hinata_hajime 阅读(192) 评论(0) 推荐(0)
FJUT 1676 QAQ和迷宫（BFS+优先队列）
摘要：QAQ和迷宫 TimeLimit: 2000/1000 MS (Java/Others) MemoryLimit: 32768/32768 K (Java/Others) TimeLimit: 2000/1000 MS (Java/Others) MemoryLimit: 32768/32768 K 阅读全文
posted @ 2017-08-30 17:18 hinata_hajime 阅读(269) 评论(0) 推荐(0)
优先队列
摘要：优先队列：优先队列不同于一般队列的是，队列中的元素按照某项特征值的大小进行排列. 优先队列的操作命令也与队列不同，队头元素为Q.top（）. 讲解详细的博客：http://www.cnblogs.com/heqinghui/archive/2013/07/30/3225407.html 一般的优先队 阅读全文
posted @ 2017-08-30 17:07 hinata_hajime 阅读(192) 评论(0) 推荐(0)
HDU 5974 A Simple Math Problem （gcd)
摘要：A Simple Math Problem Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2598 Accepted Submission(s) 阅读全文
posted @ 2017-08-30 10:48 hinata_hajime 阅读(156) 评论(0) 推荐(0)
HDU5976 Detachment （预处理前缀和+贪心+逆元）
摘要：In a highly developed alien society, the habitats are almost infinite dimensional space. In the history of this planet,there is an old puzzle. You hav 阅读全文
posted @ 2017-08-29 21:14 hinata_hajime 阅读(554) 评论(0) 推荐(0)
FJUT OJ 2584 QAQ的变强魔咒(KMP)
摘要：突然有一天默默无闻的QAQ变成了FJUTOJ的终极大BOSS，而使得QAQ变强的是QAQ掌握有一个由小写字母组成魔咒。 作为QAQ小弟的V_Dragon偷偷的听到了一部分连续魔咒，V_Dragon非常的激动，因为这一部分魔咒能使得菜鸡V_Dragon 变强100倍。但V_Dragon的听力不是很好， 阅读全文
posted @ 2017-08-29 11:26 hinata_hajime 阅读(228) 评论(0) 推荐(0)
HDU1867 A + B for you again（KMP）
摘要：A + B for you again Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7978 Accepted Submission(s): 阅读全文
posted @ 2017-08-29 11:17 hinata_hajime 阅读(249) 评论(0) 推荐(0)
POJ 1469 COURSES（二分图模板题）
摘要：Consider a group of N students and P courses. Each student visits zero, one or more than one courses. Your task is to determine whether it is possible 阅读全文
posted @ 2017-08-29 10:56 hinata_hajime 阅读(124) 评论(0) 推荐(0)
HihoCoder - 1426 What a Ridiculous Election （BFS预处理）
摘要：Problem E. What a Ridiculous Election Description In country Light Tower, a presidential election is going on. There are two candidates, Mr. X1 and Mr 阅读全文
posted @ 2017-08-29 09:54 hinata_hajime 阅读(290) 评论(0) 推荐(0)
HDU 3336 Count the string (基础KMP）
摘要：It is well known that AekdyCoin is good at string problems as well as number theory problems. When given a string s, we can write down all the non-emp 阅读全文
posted @ 2017-08-26 21:07 hinata_hajime 阅读(135) 评论(0) 推荐(0)
POJ2185 Milking Grid(KMP)
摘要：Every morning when they are milked, the Farmer John's cows form a rectangular grid that is R (1 <= R <= 10,000) rows by C (1 <= C <= 75) columns. As w 阅读全文
posted @ 2017-08-26 20:06 hinata_hajime 阅读(170) 评论(0) 推荐(0)
POJ 3693 Maximum repetition substring（后缀数组+RMQ）
摘要：Maximum repetition substring The repetition number of a string is defined as the maximum number R such that the string can be partitioned into R same 阅读全文
posted @ 2017-08-23 17:48 hinata_hajime 阅读(183) 评论(0) 推荐(0)
RMQ模板
摘要：附上一个详细的大佬的讲解 http://blog.csdn.net/niushuai666/article/details/6624672 RMQ模板（NYOJ 119） 阅读全文
posted @ 2017-08-22 21:17 hinata_hajime 阅读(224) 评论(0) 推荐(0)
KMP模板
摘要：感谢 kuangbin大神 http://www.cnblogs.com/kuangbin/archive/2012/08/14/2638803.html 转一下模板 方便自己查阅 该算法时间复杂度是O(m+n), 得到Next数组的过程是O(n) /*pku3461(Oulipo), hdu171 阅读全文
posted @ 2017-08-21 15:42 hinata_hajime 阅读(221) 评论(0) 推荐(0)
数位DP模板
摘要：#include #include #include using namespace std; int a[50]; int dp[50][50]; int dfs(int num, ,bool limit) //位数，传递条件 ，上界判断 { if(num==-1)return 0; //最后一位时，根据情况返回1或0 if(!limit && dp[num... 阅读全文
posted @ 2017-08-20 15:05 hinata_hajime 阅读(170) 评论(0) 推荐(0)
Power Strings POJ - 2406 (KMP)
摘要：Given two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of concate 阅读全文
posted @ 2017-08-16 17:05 hinata_hajime 阅读(125) 评论(0) 推荐(0)
POJ 1743 Musical Theme (后缀数组+二分）
摘要：Musical Theme A musical melody is represented as a sequence of N (1<=N<=20000)notes that are integers in the range 1..88, each representing a key on t 阅读全文
posted @ 2017-08-16 02:20 hinata_hajime 阅读(138) 评论(0) 推荐(0)
组合数计算
摘要：组合数取模就是求C(n,m)%MOD的值 当m<=1000,n<=1000时，根据 C[i][j]=(C[i-1][j]+C[i-1][j-1])的性质，可以通过递推预处理出所有的组合数 利用阶乘进行的线性求组合数 对于大范围的组合数 引用自http://blog.csdn.net/acdreame 阅读全文
posted @ 2017-08-13 17:07 hinata_hajime 阅读(214) 评论(0) 推荐(0)
线段树模板
摘要：单点更新（HDU1166） 区间更新（HDU1698） 阅读全文
posted @ 2017-08-13 13:59 hinata_hajime 阅读(207) 评论(0) 推荐(0)
树状数组模板
摘要：//查询和修改都是log(n)//从c[1]开始进行赋值，不赋c[0],n为数的个数 //sum(x)为计算前x个数的和 #include #include #include using namespace std; const int MAXN=50010; int c[MAXN]; int n; int lowbit(int x) { return x&(-x); } vo... 阅读全文
posted @ 2017-08-13 13:29 hinata_hajime 阅读(143) 评论(0) 推荐(0)