- 博客(24)
- 资源 (2)
- 收藏
- 关注
原创 hdu1257最少拦截系统(动态规划之最长递增子序列或者用类队列来算)
最少拦截系统Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 31925 Accepted Submission(s): 12555Problem Description某国为了防御敌国的导弹袭击,发展出
2016-04-28 10:06:05 463
原创 hdu1513Palindrome(动态规划之最长公共子序列变形+滚动数组)
回文问题描述回文是对称的串,也就是一个字串相同读取从左到右以及从右到左。你是写一个程序,给定的字符串,确定要被插入以获得回文字符串的字符的最小数目。作为一个例子,通过将2个字符,字符串“Ab3bd”可转化为一个回文(“dAb3bAd”或“Adb3bdA”)。然而,插入少于2个字符不产生回文。 输入你的程序是从标准输入读取。第一行包含一个整
2016-04-28 09:39:55 439
原创 hdu1503Advanced Fruits(动态规划之公共最长子序列+回溯路径)
Advanced FruitsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2485 Accepted Submission(s): 1262Special JudgeProblem Description
2016-04-28 09:25:10 436
原创 hdu1159Common Subsequence(动态规划之最长公共子序列)
Common SubsequenceTime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 5 Accepted Submission(s) : 3Problem DescriptionA subsequence o
2016-04-27 10:30:40 386
原创 hdu2594Simpsons’ Hidden Talents(kmp)
Simpsons’ Hidden TalentsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5682 Accepted Submission(s): 2050Problem DescriptionH
2016-04-27 10:13:52 266
原创 hdu3336Count the string(kmp的next的使用
Count the stringTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7567 Accepted Submission(s): 3515Problem DescriptionIt is wel
2016-04-26 10:21:25 284
原创 hdu2203亲和串(kmp+)
亲和串Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11455 Accepted Submission(s): 5161Problem Description人随着岁数的增长是越大越聪明还是越大越笨,
2016-04-26 09:07:35 484
原创 hdu2087剪花布条(kmp)
剪花布条Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14463 Accepted Submission(s): 9147Problem Description一块花布条,里面有些图案,另有一块直接可
2016-04-26 08:55:57 245
原创 hdu3746Cyclic Nacklace(kmp的next的使用)
Cyclic NacklaceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5594 Accepted Submission(s): 2530Problem DescriptionCC always
2016-04-25 10:22:02 286
原创 hdu1867A + B for you again(kmp)
A + B for you againTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5925 Accepted Submission(s): 1469Problem DescriptionGenera
2016-04-25 10:03:26 421
原创 几个最短路径算法Floyd、Dijkstra、Bellman-Ford、SPFA的比较
几个最短路径算法的比较:Floyd 求多源、无负权边的最短路。用矩阵记录图。时效性较差,时间复杂度O(V^3)。 Floyd-Warshall算法(Floyd-Warshall algorithm)是解决任意两点间的最短路径的一种算法,可以正确处理有向图或负权的最短路径问题。Floyd-Warshall算法的时间复杂度为O(N^3),空间复杂度为O(
2016-04-22 17:05:24 3303
原创 关于最短路径中的Dijkstra和Bell-man算法的区别
Bell-man算法和Dijkstra算法都是最短路径的算法,都可以用于求,单源点最短路径的问题,那么它们的区别在于什么呢?想了很久,该怎样去总结它们的区别,最后我认为从两方面总结,是比较合适的:用途特性,算法本身的区别。那么算法适用于什么样的情况,应该是有算法本身的特性来决定的,所以,算法本身的区别是关键,下面就来说明两个算法各自最核心的部分:Dijkstra:1
2016-04-22 17:02:04 2152
原创 hduFruit(母函数+每种物品都要添加最少的量)
FruitTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4217 Accepted Submission(s): 2408Problem Description转眼到了收获的季节,由于有TT的专业指导
2016-04-20 10:08:10 287
原创 hdu2069Coin Change(母函数带限制总数量)
题意:给你个硬币用1 5 10 25 50来兑换,兑换的总数量不能超出100;求有多少兑换方法。#include#include#includeusing namespace std;const int N=300;int c1[N][110],c2[N][110];int res[N],money[6]={0,1,5,10,25,50};void Init(){ memset(c1,0,si
2016-04-20 09:50:28 1127
原创 hdu1398Square Coins(母函数)
Square CoinsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10621 Accepted Submission(s): 7257Problem DescriptionPeople in Si
2016-04-20 09:28:45 267
原创 hdu1171Big Event in HDU(母函数或多重背包)
Big Event in HDUTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 33480 Accepted Submission(s): 11649Problem DescriptionNowada
2016-04-20 09:11:42 329
原创 hdu1085Holding Bin-Laden Captive!(母函数)
Holding Bin-Laden Captive!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19565 Accepted Submission(s): 8698Problem Description
2016-04-18 10:02:12 218
原创 hdu1028Ignatius and the Princess III(母函数)
Ignatius and the Princess IIITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17503 Accepted Submission(s): 12274Problem Descripti
2016-04-18 09:44:23 464
原创 hdu1709The Balance(母函数)
http://www.wutianqi.com/?p=596http://blog.chinaunix.net/uid-26602509-id-3193699.html参考的文档
2016-04-18 09:39:16 319
原创 三角形问题II
SubmitStatus Practice FZU 1888Description给定平面上的N 个点的坐标,现在你的任务是统计任意3个点构成的三角形的面积和的值。 Input有多组数据数据的第一行包含一个正整数T表示数据组数(1 对于每组数据, 第一行包含一个正整数N,代表平面上点的个数 。(1接下来N行,每行包含2个实数X
2016-04-14 17:28:17 418
原创 hdu1260Tickets(动态规划)
Problem DescriptionJesus, what a great movie! Thousands of people are rushing to the cinema. However, this is really a tuff time for Joe who sells the film tickets. He is wandering when could he g
2016-04-14 13:45:09 308
原创 hdu1231lis+起始位置和终点位置
最大连续子序列最大连续子序列Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26076 Accepted Submission(s): 11708Problem Description给定K
2016-04-14 13:38:16 297
原创 hdu1176免费馅饼·(类数塔问题)
免费馅饼Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 37890 Accepted Submission(s): 12940Problem Description都说天上不会掉馅饼,但有一天gameb
2016-04-14 12:53:56 329
原创 hdu2159FATE(付出两种代价的背包)
FATETime Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 3 Accepted Submission(s) : 3Problem Description最近xhd正在玩一款叫做FATE的游戏,为了得到极品装备,
2016-04-14 12:45:05 274
myeclipse破解
2018-03-25
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人