- 博客(4)
- 收藏
- 关注
原创 POJ2248——Addition Chains【DFS,迭代加深搜索】
题目连接:http://poj.org/problem?id=2248题目大意:现在有一个数组其中a[1] = 1,a[m] = n,并且a[1] < a[2] < ........< a[m],现在给你一个数n问,满足条件的m的最小值为多少。其中1 <= n <= 9大致思路:如果我们按照DFS直接搜索的话,一共有n!个节点十分耗时,这个时候我们可以采用迭代...
2018-11-30 21:59:59 1043
原创 HDU3336——Count the string【扩展KMP】
Count the stringTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14735 Accepted Submission(s): 6734 Problem DescriptionIt is well know...
2018-11-09 11:35:05 167
原创 HDU1238——Substrings【KMP,枚举】
SubstringsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12486 Accepted Submission(s): 6001 Problem DescriptionYou are given a numbe...
2018-11-09 11:23:32 153
原创 HDU2609——How many【最小表示法,set去重】
How manyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4190 Accepted Submission(s): 1925 Problem DescriptionGive you n ( n < 1000...
2018-11-09 11:16:12 119
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人