- 博客(45)
- 资源 (1)
- 收藏
- 关注
原创 POJ2253 Frogger(最短路变形,floyd,Dijkstra,spfa)
题目:FroggerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 40328 Accepted: 12960DescriptionFreddy Frog is sitting on a stone in the middle
2017-01-17 15:42:44 6394 10
原创 总结一下最短路径的贝尔曼-福特算法(Bellman-Ford)及用队列优化(spfa)
关于贝尔曼福特算法:百度百科:贝尔曼-福特算法------------------------------------------------------------------------------------------------分割线--------------------------------------------------------------------------
2017-01-16 17:45:07 3114
原创 邻接表的存图与遍历模板
在这里存一发,邻接表的模板:#include #include #include #include #include #include #include #include #define mem(a,b) memset(a,b,sizeof(a))using namespace std;const int inf=1<<29;int main(){ int n,
2017-01-16 08:55:42 918
原创 总结一下最短路径的迪杰斯特拉算法(Dijkstra)的基本内容以及用邻接表优化
前面转了两篇博客说了一下这个迪杰斯特拉算法,现在自己尝试总结一下。先上一个百度百科的定义:迪杰斯特拉算法--------------------------------------------------------------------------------------------------------分割线-------------------------------------
2017-01-15 17:29:13 8906 2
原创 总结一下最短路径的弗洛伊德算法(Floyd)
看了好多大牛博客,我把弗洛伊德算法在这里总结一下。弗洛伊德算法的介绍,先参考百度百科:Floyd算法再来几篇可以参考的博文:http://www.wutianqi.com/?p=1903http://www.cnblogs.com/biyeymyhjob/archive/2012/07/31/2615833.html---------------------------------
2017-01-15 16:15:13 9636 7
原创 POJ2387 Til the Cows Come Home(最短路,Dijkstra算法,spfa算法,Floyd算法,深搜DFS)
题目:Til the Cows Come HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 47642 Accepted: 16216DescriptionBessie is out in the field and wa
2017-01-14 19:36:41 4049 1
转载 单源最短路经的迪杰斯特拉算法(Dijkstra)
Dijkstra算法(单源最短路径) 单源最短路径问题,即在图中求出给定顶点到其它任一顶点的最短路径。在弄清楚如何求算单源最短路径问题之前,必须弄清楚最短路径的最优子结构性质。一.最短路径的最优子结构性质 该性质描述为:如果P(i,j)={Vi....Vk..Vs...Vj}是从顶点i到j的最短路径,k和s是这条路径上的一个中间顶点,那么P(k,s)必定是从k
2017-01-14 16:24:33 3883
原创 HDU1208 Pascal's Travels(DP)
题目:Pascal's TravelsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2296 Accepted Submission(s): 1079Problem Description
2017-01-14 11:35:34 549
原创 图片爬虫(基本完善)
这个可以爬取meizitu.com的全站图片,站长是良心站长,网页结构好分析多了,第三方库需要自己安装,主要是学习学习,存一下代码import requests ##导入requestsfrom bs4 import BeautifulSoup ##导入bs4中的BeautifulSoupimport osheaders = {'User-Agent':"Mozilla/5.0 (Win
2017-01-14 10:17:13 743
原创 HDU1579 Function Run Fun(DP,记忆化搜索)
题目:Function Run FunTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2933 Accepted Submission(s): 1501Problem Description
2017-01-14 09:45:03 449
原创 HDU1165 Eddy's research II(深搜+DP)
题目:Eddy's research IITime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4689 Accepted Submission(s): 1711Problem Description
2017-01-12 20:01:02 408
原创 HDU1160 FatMouse's Speed(DP,最长递增子序列)
题目:FatMouse's SpeedTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15266 Accepted Submission(s): 6731Special JudgeProblem D
2017-01-12 17:27:24 454
原创 HDU1158 Employment Planning(DP)
题目:Employment PlanningTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5314 Accepted Submission(s): 2275Problem Description
2017-01-12 11:57:44 405
原创 HDU1203 I NEED A OFFER!(动态规划DP)
题目:I NEED A OFFER!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25965 Accepted Submission(s): 10535Problem Description
2017-01-12 10:06:59 374
原创 HDU1159 Common Subsequence(最长公共子序列LCS)
题目:Common SubsequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 36328 Accepted Submission(s): 16630Problem Description
2017-01-11 21:03:02 535
原创 HDU1087 Super Jumping! Jumping! Jumping!(动态规划,最大递增子段和)
题目:Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 35426 Accepted Submission(s): 16112Probl
2017-01-11 16:28:40 462
原创 HDU1069 Monkey and Banana(动态规划,单调最长递减子序列)
题目:Monkey and BananaTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13354 Accepted Submission(s): 7041Problem Description
2017-01-11 15:19:27 478
原创 HDU2602/HDU1114/HDU2191(重新整理一下01背包,完全背包,多重背包)
好长时间不做背包的问题,有一点遗忘,现在把这些问题整理一下~一.01背包(HDU2602)题目:http://acm.hdu.edu.cn/showproblem.php?pid=2602题意就是普通的01背包,给出n种物品和背包容量,给出每种物品的重量和价值,求当前背包最多能达到的价值.(c[i]表示价值,w[i]表示重量)在二维中,dp[i][j]表示把前i件物品放入容量为v的
2017-01-11 13:24:03 3625
转载 Linux常用命令总结
转自:http://blog.csdn.net/ljianhui/article/details/11100625/ http://blog.csdn.net/xiaoguaihai/article/details/8705992/ http://blog.csdn.net/u012860063/article/details/50958364命令:
2017-01-11 08:54:47 537
转载 STL中常用的vector,map,set,sort 用法
STL中的常用的vector,map,set,sort,pair用法C++的标准模板库(Standard Template Library,简称STL)是一个容器和算法的类库。容器往往包含同一类型的数据。STL中比较常用的容器是vector,set和map,比较常用的算法有Sort等。.一. vector1.声明: 一个vecto
2017-01-11 08:39:59 496
原创 HDU1059 Dividing(多重背包,二进制优化,模板题)
题目:DividingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24745 Accepted Submission(s): 7052Problem DescriptionMarsha
2017-01-10 21:02:25 645
转载 01背包、完全背包、多重背包模板
一、01背包:#define N ..///N这个值是根据具体的题目来定的int v; ///v为总的容量int dp[N];void ZeroOnePack(int cost,int weight){ for(int j=v; j>=cost; j--) ///注意是逆序的 dp[j]=max(dp[j],dp[j-cost]+weight);}二、
2017-01-10 20:38:49 488
原创 HDU1058 Humble Numbers(动态规划+暴力打表)
题目:Humble NumbersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24880 Accepted Submission(s): 10947Problem Description
2017-01-10 19:51:54 521
原创 HDU1176 免费馅饼(动态规划DP)
题目:免费馅饼Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 44362 Accepted Submission(s): 15320Problem Description都说天上不会掉馅饼,
2017-01-10 16:20:30 509
原创 HDU1003 Max Sum(动态规划,最大子序列和)
题目:Max SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 230422 Accepted Submission(s): 54269Problem DescriptionGiven
2017-01-10 11:44:46 618
原创 HDU1180 诡异的楼梯(广搜BFS+优先队列)
题目:诡异的楼梯Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 13750 Accepted Submission(s): 3486Problem DescriptionHogwarts正
2017-01-10 09:27:21 514
转载 Python3 正则表达式特殊符号及用法(详细列表)
Python3 正则表达式特殊符号及用法(详细列表)正则表达式的强大之处在于特殊符号的应用,特殊符号定义了字符集合、子组匹配、模式重复次数。正是这些特殊符号使得一个正则表达式可以匹配字符串集合而不只是一个字符串。注1:为了便于理解,难点的地方均用斜体举了栗子。注2:如果你对正则表达式一头雾水或者看不懂下边这个列表,那么小甲鱼极力推荐你先学习这个:Python3 如何优雅
2017-01-09 14:20:34 14407
转载 正则表达式详解(python)
正则表达式是一个很强大的字符串处理工具,几乎任何关于字符串的操作都可以使用正则表达式来完成,作为一个爬虫工作者,每天和字符串打交道,正则表达式更是不可或缺的技能,正则表达式的在不同的语言中使用方式可能不一样,不过只要学会了任意一门语言的正则表达式用法,其他语言中大部分也只是换了个函数的名称而已,本质都是一样的。下面,我来介绍一下python中的正则表达式是怎么使用的。 首先,pyth
2017-01-08 16:58:39 747
原创 POJ1979 Red and Black(深搜DFS)
题目:Red and BlackTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 32833 Accepted: 17852DescriptionThere is a rectangular room, covered with
2017-01-08 15:37:19 421
原创 HDU1372 Knight Moves(广搜BFS+深搜DFS)
题目:Knight MovesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10658 Accepted Submission(s): 6264Problem DescriptionA f
2017-01-08 11:09:09 498
原创 HDU1572 下沙小面的(2)(深搜DFS)
题目:下沙小面的(2)Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2262 Accepted Submission(s): 983Problem Description前文再续,书接上一
2017-01-08 10:16:50 383
原创 HDU1045 Fire Net(深搜DFS)
题目:Fire NetTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10991 Accepted Submission(s): 6518Problem DescriptionSuppose
2017-01-08 08:59:24 486
原创 HDU2616 Kill the monster(深搜DFS)
题目:Kill the monsterTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1404 Accepted Submission(s): 959Problem DescriptionT
2017-01-07 20:26:31 599
转载 Python-第三方库requests详解
Requests 是用Python语言编写,基于 urllib,采用 Apache2 Licensed 开源协议的 HTTP 库。它比 urllib 更加方便,可以节约我们大量的工作,完全满足 HTTP 测试需求。Requests 的哲学是以 PEP 20 的习语为中心开发的,所以它比 urllib 更加 Pythoner。更重要的一点是它支持 Python3 哦!Beautiful
2017-01-07 18:59:46 1214
原创 POJ2488 A Knight's Journey(深搜DFS,字典序,骑士游历问题)
题目:A Knight's JourneyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 42989 Accepted: 14597DescriptionBackground The knight is getting bo
2017-01-07 17:35:59 2625
转载 POJ题目分类推荐 (很好很有层次感)
初期:一.基本算法:枚举. (POJ 1753,POJ 2965)贪心(POJ 1328,POJ 2109,POJ 2586)递归和分治法.递推.构造法.(POJ 3295)模拟法.(POJ 1068,POJ 2632,POJ 1573,POJ 2993,POJ 2996)二.图算法:图的深度优先遍历和广度优先遍历.最短路
2017-01-07 16:35:07 2364
原创 POJ1088 滑雪(动态规划+深搜DFS)
题目:滑雪Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 94177 Accepted: 35668DescriptionMichael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你
2017-01-07 14:44:12 681
原创 POJ3126 Prime Path(广搜BFS)
题目:Prime PathTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 18523 Accepted: 10409DescriptionThe ministers of the cabinet were quite upset
2017-01-06 17:23:31 376
原创 POJ3414 Pots(路径记录,广搜BFS,模拟)
题目:PotsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15275 Accepted: 6433 Special JudgeDescriptionYou are given two pots, having the
2017-01-06 15:38:13 421
原创 HDU1495 非常可乐(模拟,广搜BFS)
题目:非常可乐Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12407 Accepted Submission(s): 4950Problem Description大家一定觉的运动以后喝
2017-01-05 21:54:42 550
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人