栈和队列
星星的泪痕
这个作者很懒,什么都没留下…
展开
-
H - Array
点击打开链接Vitaly has an array of n distinct integers. Vitaly wants to divide this array into three non-empty sets so as the following conditions hold:The product of all numbers in the first原创 2017-07-26 15:05:17 · 242 阅读 · 0 评论 -
I - 0和5
点击打开链接小K手中有n张牌,每张牌上有一个一位数的数,这个字数不是0就是5。小K从这些牌在抽出任意张(不能抽0张),排成一行这样就组成了一个数。使得这个数尽可能大,而且可以被90整除。注意:1.这个数没有前导0,2.小K不需要使用所有的牌。Input每个测试数据输入共2行。 第一行给出一个n,表示n张牌。(1第二行给出n个整数a[0],a[1]原创 2017-07-26 15:07:27 · 218 阅读 · 0 评论 -
E - 寻找大富翁
点击打开链接浙江桐乡乌镇共有n个人,请找出该镇上的前m个大富翁.Input输入包含多组测试用例. 每个用例首先包含2个整数n(0n和m同时为0时表示输入结束.Output请输出乌镇前m个大富翁的财产数,财产多的排前面,如果大富翁不足m个,则全部输出,每组输出占一行.Sample Input3 12 5 -15 31 2 3 4 50 0原创 2017-07-26 14:53:45 · 212 阅读 · 0 评论 -
D - 看病要排队(优先队列,<的重载)
点击打开链接看病要排队这个是地球人都知道的常识。 不过经过细心的0068的观察,他发现了医院里排队还是有讲究的。0068所去的医院有三个医生(汗,这么少)同时看病。而看病的人病情有轻重,所以不能根据简单的先来先服务的原则。所以医院对每种病情规定了10种不同的优先级。级别为10的优先权最高,级别为1的优先权最低。医生在看病时,则会在他的队伍里面选择一个优先权最高的人进行诊治。原创 2017-07-26 14:42:46 · 208 阅读 · 0 评论 -
ACboy needs your help again!(栈和队列)
点击打开链接ACboy was kidnapped!! he miss his mother very much and is very scare now.You can't image how dark the room he was put into is, so poor :(. As a smart ACMer, you want to get ACboy原创 2017-07-26 14:34:07 · 355 阅读 · 0 评论 -
Train Problem I
点击打开链接As the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because the trains in the Ignatius Train Station is the fa原创 2017-07-26 14:37:41 · 182 阅读 · 0 评论 -
F - Rails
点击打开链接There is a famous railway station in PopPush City. Country there is incredibly hilly. The station was built in last century. Unfortunately, funds were extremely limited that time. It w原创 2017-07-26 14:57:06 · 151 阅读 · 0 评论 -
G - Replace To Make Regular Bracket Sequence
点击打开链接You are given string s consists of opening and closing brackets of four kinds , {}, [], (). There are two types of brackets: opening and closing. You can replace any bracket by anoth原创 2017-07-26 14:58:52 · 219 阅读 · 0 评论