随笔分类 -  栈和队列

1
摘要:Bad Hair DayTime Limit:2000MSMemory Limit:65536KTotal Submissions:15922Accepted:5374DescriptionSome of Farmer John'sNcows (1 ≤N≤ 80,000) are having a ... 阅读全文
posted @ 2015-11-14 18:46 非我非非我 阅读(145) 评论(0) 推荐(0) 编辑
摘要:The kth great numberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 8246Accepted Submission(s): 32... 阅读全文
posted @ 2015-07-28 16:39 非我非非我 阅读(157) 评论(0) 推荐(0) 编辑
摘要:Windows Message QueueTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4352Accepted Submission(s): 1... 阅读全文
posted @ 2015-07-28 14:49 非我非非我 阅读(200) 评论(0) 推荐(0) 编辑
摘要:懒省事的小明时间限制:3000ms | 内存限制:65535KB难度:3描述 小明很想吃果子,正好果园果子熟了。在果园里,小明已经将所有的果子打了下来,而且按果子的不同种类分成了不同的堆。小明决定把所有的果子合成一堆。 因为小明比较懒,为了省力气,小明开始想点子了: 每一次合并,小明可以把两堆果子... 阅读全文
posted @ 2015-07-28 14:25 非我非非我 阅读(184) 评论(0) 推荐(0) 编辑
摘要:StonesTime Limit: 5000/3000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1363Accepted Submission(s): 850Problem Descr... 阅读全文
posted @ 2015-07-28 11:48 非我非非我 阅读(201) 评论(0) 推荐(0) 编辑
摘要:期末考试时间限制:1000ms | 内存限制:65535KB难度:2描述马上就要考试了,小T有许多作业要做,而且每个老师都给出来了作业要交的期限,如果在规定的期限内没交作业就会扣期末成绩的分数,假设完成每门功课需要一天的时间,你能帮助小T扣除的分数最小吗?输入输入n,表示n门功课(n#include... 阅读全文
posted @ 2015-07-28 10:21 非我非非我 阅读(157) 评论(0) 推荐(0) 编辑
摘要:看病要排队Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5795Accepted Submission(s): 2384Problem Descr... 阅读全文
posted @ 2015-07-27 20:45 非我非非我 阅读(490) 评论(2) 推荐(0) 编辑
摘要:Nightmare时间限制:1000ms | 内存限制:65535KB难度:4描述Ignatius had a nightmare last night. He found himself in a labyrinth with a time bomb on him. The labyrinth h... 阅读全文
posted @ 2015-07-08 22:56 非我非非我 阅读(215) 评论(0) 推荐(0) 编辑
摘要:WAJUEJI which home strong!时间限制:1000ms | 内存限制:65535KB难度:2描述在一个山沟里,姐弟俩同时考上了大学。但由于家里拮据,所以这并不是什么好消息。父亲对孩子说:我就是砸锅卖铁也要把你们姐俩供出来。当时的姐姐已经决定放弃上学的机会。没想到第二天天还没亮,弟... 阅读全文
posted @ 2015-07-04 23:28 非我非非我 阅读(307) 评论(0) 推荐(0) 编辑
摘要:迷宫问题Time Limit:1000MSMemory Limit:65536KTotal Submissions:10103Accepted:6005Description定义一个二维数组:int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0,... 阅读全文
posted @ 2015-06-22 21:06 非我非非我 阅读(391) 评论(0) 推荐(0) 编辑
摘要:Dungeon MasterTime Limit:1000MSMemory Limit:65536KTotal Submissions:19222Accepted:7466DescriptionYou are trapped in a 3D dungeon and need to find the ... 阅读全文
posted @ 2015-06-22 18:10 非我非非我 阅读(155) 评论(0) 推荐(0) 编辑
摘要:胜利大逃亡Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 28023 Accepted Submission(s): 10632Problem D... 阅读全文
posted @ 2015-06-21 00:15 非我非非我 阅读(257) 评论(0) 推荐(0) 编辑
摘要:Find a wayTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5401Accepted Submission(s): 1823Problem ... 阅读全文
posted @ 2015-06-20 20:25 非我非非我 阅读(280) 评论(0) 推荐(0) 编辑
摘要:RescueTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19985Accepted Submission(s): 7110Problem Des... 阅读全文
posted @ 2015-06-17 20:15 非我非非我 阅读(215) 评论(0) 推荐(0) 编辑
摘要:Train Problem ITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24980Accepted Submission(s): 9424Pr... 阅读全文
posted @ 2015-06-17 13:04 非我非非我 阅读(191) 评论(0) 推荐(0) 编辑
摘要:可以实现简单的加减乘除四则运算#include#include#define MAX 10100int main(){ int j,i,s,t,top,wrong,a; double n,m,sum; char fu,kongge; double zhan[MAX]; printf("------... 阅读全文
posted @ 2015-06-13 17:04 非我非非我 阅读(1607) 评论(0) 推荐(0) 编辑
摘要:ACboy needs your help again!Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4241Accepted Submissio... 阅读全文
posted @ 2015-06-10 23:15 非我非非我 阅读(182) 评论(0) 推荐(0) 编辑
摘要:愚人节的礼物Time Limit: 5000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6283Accepted Submission(s): 3805Problem Desc... 阅读全文
posted @ 2015-06-10 22:08 非我非非我 阅读(150) 评论(0) 推荐(0) 编辑
摘要:简单计算器Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14512Accepted Submission(s): 4920Problem Desc... 阅读全文
posted @ 2015-06-10 21:53 非我非非我 阅读(315) 评论(0) 推荐(0) 编辑
摘要:栈遵循先进后出的原则 括号配对问题时间限制:3000ms | 内存限制:65535KB难度:3描述现在,有一行括号序列,请你检查这行括号是否配对。输入第一行输入一个数N(0#include#define MAX 101000char zhan[MAX],str[MAX... 阅读全文
posted @ 2015-06-10 10:40 非我非非我 阅读(223) 评论(0) 推荐(0) 编辑

1
点击右上角即可分享
微信分享提示