- 博客(138)
- 收藏
- 关注
原创 HDOJ 1873 看病要排队(优先队列)
看病要排队Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6129 Accepted Submission(s): 2526Problem Description看病要排队这个是地球人都知道的常识。不过经过
2015-07-31 17:58:37 411
原创 HDOJ 1702 ACboy needs your help again!(栈和队列)
ACboy needs your help again!Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4462 Accepted Submission(s): 2281Problem DescriptionA
2015-07-31 10:33:15 666
原创 HDOJ 1022 Train Problem I(栈)
Train Problem ITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26100 Accepted Submission(s): 9852Problem DescriptionAs the new te
2015-07-30 19:13:19 775
原创 HDOJ 3420 Bus Fair(动规)
Bus FairTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 899 Accepted Submission(s): 443Problem DescriptionYou are now in Foolish
2015-07-30 16:19:46 379
原创 HDOJ 2041 超级楼梯(水题)(规律)
超级楼梯Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 37697 Accepted Submission(s): 19374Problem Description有一楼梯共M级,刚开始时你在第一级,若每次只能
2015-07-30 10:57:59 349
原创 HDOJ 1017 A Mathematical Curiosity
A Mathematical CuriosityTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 31697 Accepted Submission(s): 10152Problem DescriptionGiv
2015-07-30 10:21:29 351
原创 HDOJ 1051 Wooden Sticks(贪心)
Wooden SticksTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14853 Accepted Submission(s): 6090Problem DescriptionThere is a pile
2015-07-29 21:17:08 552 3
原创 HDOJ 1870 愚人节的礼物(水题)(栈练习)
愚人节的礼物Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6428 Accepted Submission(s): 3903Problem Description四月一日快到了,Vayko想了个愚人的好办法—
2015-07-28 19:29:57 352
转载 简单计算器(栈)
转于:http://blog.csdn.net/zhengxu001/article/details/8022085转自 Bupt Acmer任意表达式(expression)都是由操作数(operand)操作符(operator)和界限符(delimiter)组成。我们通常习惯使用中缀表达式(infix expression),但中缀表达式离不开括号(bracket)。若使用
2015-07-28 17:45:03 2141 2
转载 STL中栈和队列的使用方法
STL 中优先队列的使用方法(priority_queu)基本操作:empty() 如果队列为空返回真pop() 删除对顶元素push() 加入一个元素size() 返回优先队列中拥有的元素个数top() 返回优先队列对顶元素在默认的优先队列中,优先级高的先出队。在默认的int型中先出队的为较大的数。使用方法:头文件: #include
2015-07-28 17:37:46 4260 1
转载 C++ STL栈和队列的使用
转载于http://m.blog.csdn.net/blog/ziyuzhao123/39947481一、栈栈的定义在头文件中,stack 模板类需要两个模板参数,一个是元素类型,一个容器类型,但只有元素类型是必要的,在不指定容器类型时,默认的容器类型为deque。定义stack 对象的示例代码如下:stack s1;stack s2;stack的基本操作有:对
2015-07-28 17:27:13 540
原创 HDOJ 1012 u Calculate e(水题)
u Calculate eTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 35564 Accepted Submission(s): 16038Problem DescriptionA simple mathe
2015-07-27 17:41:44 327
原创 HDOJ 2000 ASCII码排序(水题)(多方法)
ASCII码排序Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 108285 Accepted Submission(s): 45236Problem Description输入三个字符后,按各字符的ASCII
2015-07-27 11:08:54 534
原创 HDOJ 1005 Number Sequence(规律)
Number SequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 127173 Accepted Submission(s): 30910Problem DescriptionA number se
2015-07-27 09:36:23 392
转载 STL
向量(vector) 连续存储的元素Vectorc;c.back() 传回最后一个数据,不检查这个数据是否存在。c.clear() 移除容器中所有数据。c.empty() 判断容器是否为空。c.front() 传回地一个数据。c.pop_back() 删除最后一个数据。c.push_back(elem) 在尾部加入一个数据。c[i]
2015-07-27 08:41:52 419
原创 HDOJ 1013 Digital Roots(大数)
Digital RootsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 58524 Accepted Submission(s): 18278Problem DescriptionThe digital ro
2015-07-26 21:18:12 459
原创 NYOJ 79 拦截导弹
拦截导弹时间限制:3000 ms | 内存限制:65535 KB难度:3描述 某国为了防御敌国的导弹袭击,发展中一种导弹拦截系统。但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能高于等于前一发的高度。某天,雷达捕捉到敌国导弹来袭。由于该系统还在试用阶段,所以只用一套系统,因此有可能不能拦截所有的导弹。输入第一行输入测试数据组
2015-07-25 21:22:06 372
原创 HDOJ 1008 Elevator(水题)
ElevatorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 52113 Accepted Submission(s): 28762Problem DescriptionThe highest buildin
2015-07-25 15:29:56 314
原创 HDOJ 1004 Let the Balloon Rise(水题)
Let the Balloon RiseTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 89158 Accepted Submission(s): 33749Problem DescriptionContest
2015-07-25 11:21:25 430
原创 HDOJ 2004 成绩转换(水题)(多方法)
成绩转换Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 93973 Accepted Submission(s): 41424Problem Description输入一个百分制的成绩t,将其转换成对应的等级,
2015-07-25 10:17:33 331
原创 HDOJ 2003 求绝对值(水题)
求绝对值Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 81935 Accepted Submission(s): 41994Problem Description求实数的绝对值。 Input输
2015-07-25 09:39:01 238
原创 HDOJ 2001 计算两点间的距离(水题)
计算两点间的距离Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 121841 Accepted Submission(s): 46470Problem Description输入两点坐标(X1,Y1),(X2,
2015-07-25 09:33:56 330
原创 HDOJ 1096 A+B for Input-Output Practice (VIII)(水题)
A+B for Input-Output Practice (VIII)Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 114595 Accepted Submission(s): 35170Problem Des
2015-07-25 09:23:40 363
原创 HDOJ 1095 A+B for Input-Output Practice (VII)(水题)
A+B for Input-Output Practice (VII)Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 52655 Accepted Submission(s): 35297Problem Descr
2015-07-25 09:17:54 306
原创 HDOJ 1094 A+B for Input-Output Practice (VI)(水题)
A+B for Input-Output Practice (VI)Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 53165 Accepted Submission(s): 35864Problem Descri
2015-07-25 09:14:35 342
原创 HDOJ 1093 A+B for Input-Output Practice (V)(水题)
A+B for Input-Output Practice (V)Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 56816 Accepted Submission(s): 38284Problem Descrip
2015-07-25 09:09:57 331
原创 HDOJ 1092 A+B for Input-Output Practice (IV)(水题)
A+B for Input-Output Practice (IV)Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 76476 Accepted Submission(s): 40937Problem Descri
2015-07-25 09:05:06 358
原创 HDOJ 1091 A+B for Input-Output Practice (III)(水题)
A+B for Input-Output Practice (III)Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 84517 Accepted Submission(s): 44325Problem Descr
2015-07-25 09:02:27 451
原创 HDOJ 1090 A+B for Input-Output Practice (II)(水题)
A+B for Input-Output Practice (II)Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 73588 Accepted Submission(s): 47833Problem Descri
2015-07-25 09:00:02 344
原创 HDOJ 1089 A+B for Input-Output Practice (I)(水题)
A+B for Input-Output Practice (I)Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 97704 Accepted Submission(s): 54128Problem Descrip
2015-07-25 08:55:22 479
原创 NYOJ 108 士兵杀敌(一)
士兵杀敌(一)时间限制:1000 ms | 内存限制:65535 KB难度:3描述 南将军手下有N个士兵,分别编号1到N,这些士兵的杀敌数都是已知的。小工是南将军手下的军师,南将军现在想知道第m号到第n号士兵的总杀敌数,请你帮助小工来回答南将军吧。注意,南将军可能会问很多次问题。输入只有一组测试数据第一行是两个整数N,M,其中N表示士兵的个数(1随后的一
2015-07-24 20:04:06 334
原创 NYOJ 5 Binary String Matching(数据结构)
Binary String Matching时间限制:3000 ms | 内存限制:65535 KB难度:3描述 Given two strings A and B, whose alphabet consist only ‘0’ and ‘1’. Your task is only to tell how many times does A appear as a subst
2015-07-24 17:57:52 330
原创 做动态规划题的步骤和例子(还在完善中)
度娘上的:1.将待求解问题分解成若干个子问题,先求解子问题,然后从这些子问题的解得到原问题的解。保存已解决的子问题的答案,在需要时再找出已求得的答案,这样就可以避免大量的重复计算,节省时间。我们可以用一个表来记录所有已解的子问题的答案。不管该子问题以后是否被用到,只要它被计算过,就将其结果填入表中。这就是动态规划法的基本思路。具体的动态规划算法多种多样,但它们具有相同的填表格式。
2015-07-24 11:28:51 1348
原创 HDOJ 1019 Least Common Multiple(最小公倍最大公约)
Least Common MultipleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 38281 Accepted Submission(s): 14413Problem DescriptionThe le
2015-07-23 19:43:08 419
原创 HDOJ 1718 Rank(结构体)
RankTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4347 Accepted Submission(s): 1684Problem DescriptionJackson wants to know his
2015-07-23 19:28:58 433
原创 HDOJ 1003 Max Sum(动态规划)
Max SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 176237 Accepted Submission(s): 41047Problem DescriptionGiven a sequence a[
2015-07-23 17:56:07 475
原创 HDOJ 1231 最大连续子序列(动态规划)
最大连续子序列Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22869 Accepted Submission(s): 10149Problem Description给定K个整数的序列{ N1, N2, .
2015-07-23 16:30:55 382
转载 __int64 与long long int
__int64 与long long int在做ACM题时,经常都会遇到一些比较大的整数。而常用的内置整数类型常常显得太小了:其中long 和 int 范围是[-2^31,2^31),即-2147483648~2147483647。而unsigned范围是[0,2^32),即0~4294967295。也就是说,常规的32位整数只能够处理40亿以下的数。 那遇到比40亿要大的数怎么办呢
2015-07-23 10:17:11 610 1
原创 HDOJ 1998 奇数阶魔方
奇数阶魔方Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3073 Accepted Submission(s): 1615Problem Description一个 n 阶方阵的元素是1,2,...,n^2,
2015-07-23 09:43:00 444
原创 HDOJ 1860 统计字符
统计字符Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8558 Accepted Submission(s): 5416Problem Description统计一个给定字符串中指定的字符出现的次数
2015-07-22 21:07:57 411
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人