栈与队列
纯真zwj
这个作者很懒,什么都没留下…
展开
-
NYOJ 括号配对问题
括号配对问题时间限制:3000 ms | 内存限制:65535 KB难度:3描述现在,有一行括号序列,请你检查这行括号是否配对。输入第一行输入一个数N(0输出每组输入数据的输出占一行,如果该字符串中所含的括号是配对的,则输出Yes,如果不配对则输出No样例输入3[(])(])([[]()])样例输出NoNoYes原创 2015-01-05 16:09:40 · 839 阅读 · 0 评论 -
POJ 3253 Fence Repair(贪心—霍夫曼树or优先队列)
Fence RepairTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 34063Accepted: 10969DescriptionFarmer John wants to repair a smal原创 2015-11-18 21:13:45 · 643 阅读 · 0 评论 -
POJ 3250 Bad Hair Day(单调栈stack)
Bad Hair DayTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 15958Accepted: 5392DescriptionSome of Farmer John's N cows (1 ≤ N原创 2015-11-16 16:14:03 · 635 阅读 · 0 评论 -
POJ 2431 Expedition(优先队列)
ExpeditionTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9952 Accepted: 2899DescriptionA group of cows grabbed a truck and ventur原创 2015-11-25 13:09:32 · 610 阅读 · 0 评论 -
POJ 2010 Moo University - Financial Aid(优先队列or二分搜索—最大化K大值)
Moo University - Financial AidTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 6572 Accepted: 1923DescriptionBessie noted that although humans have many un原创 2016-01-07 00:03:21 · 880 阅读 · 0 评论 -
POJ 2082 Terrible Sets(栈)
Terrible SetsTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 4348 Accepted: 2248DescriptionLet N be the set of all natural numbers {0 , 1 , 2 , . . . },原创 2016-07-19 17:37:39 · 478 阅读 · 0 评论 -
POJ 2259 Team Queue(队列)
Team QueueTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 3987 Accepted: 1407DescriptionQueues and Priority Queues are data structures which are known t原创 2016-07-20 20:53:35 · 1459 阅读 · 0 评论 -
HDOJ 5818 Joint Stacks(栈)
Joint StacksTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 399 Accepted Submission(s): 175Problem DescriptionA stack is a da原创 2016-08-09 21:59:54 · 392 阅读 · 0 评论 -
codeforces 754D Fedor and coupons(优先队列)
D. Fedor and couponstime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAll our characters have hobbies. The s原创 2017-01-07 05:15:39 · 1172 阅读 · 0 评论 -
HDOJ 4006 The kth great number(优先队列)
The kth great numberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 8253 Accepted Submission(s): 3265Problem DescriptionXiao Mi原创 2015-07-28 17:52:34 · 711 阅读 · 4 评论 -
HDOJ 1873 看病要排队(优先队列)
看病要排队Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5838 Accepted Submission(s): 2405Problem Description看病要排队这个是地球人都知道的常识。不过原创 2015-07-28 12:27:20 · 1317 阅读 · 0 评论 -
HDOJ 1896 Stones(优先队列)
StonesTime Limit: 5000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1385 Accepted Submission(s): 866Problem DescriptionBecause of the wrong s原创 2015-07-28 20:30:37 · 737 阅读 · 0 评论 -
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): 4022 Accepted Submission(s): 2019Problem Description原创 2015-03-28 19:09:40 · 670 阅读 · 0 评论 -
HDOJ 1022 Train Problem I
Train Problem ITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24961 Accepted Submission(s): 9416Problem DescriptionAs the new原创 2015-06-14 21:44:23 · 454 阅读 · 0 评论 -
NYOJ 2 括号配对问题(STL—stack解法)
括号配对问题时间限制:3000 ms | 内存限制:65535 KB难度:3描述 现在,有一行括号序列,请你检查这行括号是否配对。输入第一行输入一个数N(0输出每组输入数据的输出占一行,如果该字符串中所含的括号是配对的,则输出Yes,如果不配对则输出No样例输入3[(])(])([[]()])样例输出NoNoYes 学原创 2015-07-27 11:51:23 · 596 阅读 · 0 评论 -
STL之stack(栈)
本文转载于:点击打开链接 栈(statck)这种数据结构在计算机中是相当出名的。栈中的数据是先进后出的(First In Last Out, FILO)。栈只有一个出口,允许新增元素(只能在栈顶上增加)、移出元素(只能移出栈顶元素)、取得栈顶元素等操作。在STL中,栈是以别的容器作为底部结构,再将接口改变,使之符合栈的特性就可以了。因此实现非常的方便。下面就给出栈的函数列表和VS2008中转载 2015-07-27 11:29:13 · 492 阅读 · 0 评论 -
HDOJ 1237 简单计算器(堆栈)
简单计算器Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14833 Accepted Submission(s): 5050Problem Description读入一个只包含 +, -, *, / 的非原创 2015-07-27 23:42:23 · 946 阅读 · 0 评论 -
HDOJ 3785 寻找大富翁(优先队列,水)
寻找大富翁Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4500 Accepted Submission(s): 1835Problem Description浙江桐乡乌镇共有n个人,请找出该镇上的前m个原创 2015-07-28 16:55:26 · 533 阅读 · 0 评论 -
NYOJ 55 懒省事的小明(优先队列)
懒省事的小明时间限制:3000 ms | 内存限制:65535 KB难度:3描述 小明很想吃果子,正好果园果子熟了。在果园里,小明已经将所有的果子打了下来,而且按果子的不同种类分成了不同的堆。小明决定把所有的果子合成一堆。 因为小明比较懒,为了省力气,小明开始想点子了: 每一次合并,小明可以把两堆果子合并到一起,消耗的体力等于两堆果子的重量之和。可以看出,原创 2015-07-28 12:41:15 · 587 阅读 · 0 评论 -
HDOJ 1509 Windows Message Queue(优先队列)
Windows Message QueueTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4380 Accepted Submission(s): 1735Problem DescriptionMessag原创 2015-07-28 16:15:37 · 524 阅读 · 0 评论 -
51nod 1478 括号序列的最长合法子段(栈-括号匹配寻找最长合法子串长度及其个数)
1478 括号序列的最长合法子段题目来源: CodeForces基准时间限制:1 秒 空间限制:131072 KB 分值: 40 难度:4级算法题 收藏 关注这里有另一个关于处理合法的括号序列的问题。如果插入“+”和“1”到一个括号序列,我们能得到一个正确的数学表达式,我们就认为这个括号序列是合法的。例如,序列"(())()", "()"和"(()(()))"是合法的,但是")(", "(()"和...原创 2017-03-16 01:28:14 · 2588 阅读 · 0 评论