STL
文章平均质量分 71
键盘上的舞者
这个作者很懒,什么都没留下…
展开
-
HDU1702:ACboy needs your help again!
Problem DescriptionACboy 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 ACb原创 2013-03-30 13:25:34 · 2222 阅读 · 0 评论 -
LA3135:Argus(优先队列)
A data stream is a real-time, continuous, ordered sequence of items. Some examples include sensor data,Internet traffic, financial tickers, on-line auctions, and transaction logs such as Web usage l原创 2015-06-10 19:20:08 · 931 阅读 · 0 评论 -
HDU4941:Magical Forest(map)
Problem DescriptionThere is a forest can be seen as N * M grid. In this forest, there is some magical fruits, These fruits can provide a lot of energy, Each fruit has its location(Xi, Yi) and the原创 2014-08-15 13:26:53 · 1442 阅读 · 0 评论 -
UVA11995:I Can Guess the Data Structure
There is a bag-like data structure, supporting two operations:1 x Throw an element x into the bag.2 Take out an element from the bag.Given a sequence of operations with return values, you’re goi原创 2015-06-10 16:41:38 · 606 阅读 · 0 评论 -
UVA11991:Easy Problem from Rujia Liu?(STL构建变长二维数组)
11991 Easy Problem from Rujia Liu?Though Rujia Liu usually sets hard problems for contests (for example, regionalcontests like Xi’an 2006, Beijing 2007 and Wuhan 2009, or UVa OJ contests likeRuj原创 2015-06-10 17:04:51 · 710 阅读 · 0 评论 -
ZOJ3782:Ternary Calculation
Complete the ternary calculation.InputThere are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case:There is a string in th原创 2014-04-13 20:26:28 · 2545 阅读 · 0 评论 -
BNU29373:Key Logger(栈的迭代器使用)
Decode the message from the given key logger. The logger consists:’-’ representing backspace: the character directly before the cursor position is deleted, if there is any.’’) representing the l原创 2013-10-05 18:59:05 · 1554 阅读 · 0 评论 -
BNU29368:Check the Identity(栈)
Just determine whether an algebraic expression can always simplify to zero.Input The first line contains a single integer T, indicating the number of test cases.Each test case starts with an i原创 2013-10-05 18:44:06 · 1516 阅读 · 0 评论 -
CSU1306:Manor(优先队列)
DescriptionBob有n个正整数,他将这n个整数根据大小划分成两部分。对于小于等于k的整数放在集合A中,其余的放在集合B中。每次他从集合B中取出一个最大的值,将其变成0放入A集合中。然后将A集合中所有的元素都增加a,如果此时A中元素大于k,那么要将该元素放入B中,同时将B集合中剩余的元素都增加b。Bob现在想知道经过m次操作后,B集合中元素的个数。Input原创 2013-08-31 20:25:18 · 1613 阅读 · 0 评论 -
HDU1412:{A} + {B}
Problem Description给你两个集合,要求{A} + {B}.注:同一个集合中不会有两个相同的元素. Input每组输入数据分为三行,第一行有两个数字n,m(0 Output针对每组数据输出一行数据,表示合并后的集合,要求从小到大输出,每个元素之间有一个空格隔开. Sample Input1 212 31 2原创 2013-07-28 20:24:39 · 2400 阅读 · 2 评论 -
POJ1363:Rails
DescriptionThere 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 was原创 2013-07-22 14:59:28 · 12228 阅读 · 1 评论 -
HDU3415:Max Sum of Max-K-sub-sequence(单调队列)
Problem DescriptionGiven a circle sequence A[1],A[2],A[3]......A[n]. Circle sequence means the left neighbour of A[1] is A[n] , and the right neighbour of A[n] is A[1].Now your job is to calculate原创 2013-07-22 14:41:28 · 3429 阅读 · 1 评论 -
HDU1237:简单计算器
Problem Description读入一个只包含 +, -, *, / 的非负整数计算表达式,计算该表达式的值。 Input测试输入包含若干测试用例,每个测试用例占一行,每行不超过200个字符,整数和运算符之间用一个空格分隔。没有非法表达式。当一行中只有0时输入结束,相应的结果不要输出。 Output对每个测试用例输出1行,即该表达式的值,精确到小数原创 2013-03-30 16:52:40 · 1409 阅读 · 0 评论 -
UVA673 :Parentheses Balance
这道题目是一道比较简单的栈的模拟题目注意如果输入是空行也要输出Yes,因为没有注意这个果断WA了一次 #include #include char str[300];int len,k;char stack[300];void input(int k,int i){ stack[k] = str[i];}void out(in原创 2013-05-16 18:20:00 · 1442 阅读 · 0 评论 -
HDU1870:愚人节的礼物
Problem Description四月一日快到了,Vayko想了个愚人的好办法——送礼物。嘿嘿,不要想的太好,这礼物可没那么简单,Vayko为了愚人,准备了一堆盒子,其中有一个盒子里面装了礼物。盒子里面可以再放零个或者多个盒子。假设放礼物的盒子里不再放其他盒子。用()表示一个盒子,B表示礼物,Vayko想让你帮她算出愚人指数,即最少需要拆多少个盒子才能拿到礼物。 I原创 2013-04-10 20:18:28 · 1756 阅读 · 0 评论 -
HDU1022:Train Problem I
Problem DescriptionAs 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 t原创 2013-03-30 15:34:16 · 1051 阅读 · 0 评论 -
UVA11997:K Smallest Sums(多路归并求最小k个和)
You’re given k arrays, each array has k integers. There are kk ways to pick exactly one element in eacharray and calculate the sum of the integers. Your task is to find the k smallest sums among t原创 2015-06-10 20:26:41 · 1525 阅读 · 0 评论