数据结构
文章平均质量分 68
RookieZQF
尽自己最大努力才能不后悔
展开
-
Web Navigation
DescriptionStandard web browsers contain features to move backward and forward among the pages recently visited. One way to implement these features is to use two stacks to keep track of the pages t翻译 2015-11-03 15:44:52 · 1097 阅读 · 0 评论 -
Flipping Burned Pancakes
DescriptionThe cook at the Frobbozz Magic Pancake House sometimes falls asleep on the job while cooking pancakes. As a result, one side of a stack of pancakes is often burned. Clearly, it is bad b翻译 2015-11-12 08:36:34 · 537 阅读 · 0 评论 -
Additive equations
Description We all understand that an integer set is a collection of distinct integers. Now the question is: given an integer set, can you find all its addtive equations? To explain what anad翻译 2015-11-13 15:22:13 · 334 阅读 · 0 评论 -
Skip Letter Code
DescriptionRomeo and Juliet are college students in the city of Verona and are in love with each other. Unfortunately, both their families are not very glad with this fact. They are trying to prev翻译 2015-11-19 21:04:12 · 541 阅读 · 0 评论 -
玉蟾宫
题目描述 Description 有一天,小猫rainbow和freda来到了湘西张家界的天门山玉蟾宫,玉蟾宫宫主蓝兔盛情地款待了它们,并赐予它们一片土地。 这片土地被分成N*M个格子,每个格子里写着'R'或者'F',R代表这块土地被赐予了rainbow,F代表这块土地被赐予了freda。 现在freda要在这里卖萌。。。它要找一块矩形土地,要求这片土地都标着'F'并且翻译 2015-11-29 16:20:46 · 1177 阅读 · 0 评论 -
NYOJ 35 表达式求值 or 267 郁闷的C小加(二)
描述 聪明的你帮助C小加解决了中缀表达式到后缀表达式的转换(详情请参考“郁闷的C小加(一)”),C小加很高兴。但C小加是个爱思考的人,他又想通过这种方法计算一个表达式的值。即先把表达式转换为后缀表达式,再求值。这时又要考虑操作数是小数和多位数的情况。输入第一行输入一个整数T,共有T组测试数据(T每组测试数据只有一行,是一个长度不超过1000的字符串,表示这个运算式,每个运算式都是以“=翻译 2016-01-23 18:26:54 · 426 阅读 · 0 评论 -
POJ 3321 Apple Tree
DescriptionThere is an apple tree outside of kaka's house. Every autumn, a lot of apples will grow in the tree. Kaka likes apple very much, so he has been carefully nurturing the big apple tree.翻译 2016-01-23 18:45:58 · 344 阅读 · 0 评论 -
LA 3882 And Then There Was One
这道题是一道约瑟夫环问题,只不过数据加强了,因为不需要求出删除序列,只需要求出删除的最后一个的数字,所以有递推的方法和线段树#include #include #define lson l, m, rt << 1#define rson m+1, r, rt << 1 | 1const int maxn = 1000005;int cnt[maxn << 3];void Bui翻译 2015-12-06 22:17:06 · 223 阅读 · 0 评论 -
NYOJ 600 花儿朵朵
描述输入第一行有个整数t,表示有t组测试数据,每组测试数据第一行为两个整数n,m(0输出对于每次游客的询问,输出一个整数在单独的一行,表示这个时间盛开的花有多少种。样例输入21 15 1042 31 44 8146样例输出0121春天到了,花儿朵朵盛开,hrdv是一座大花园的主人,在他的花园里种着许多种鲜花,每当这个时候,就会有一大群翻译 2016-01-25 20:47:22 · 457 阅读 · 0 评论 -
Largest Rectangle in a Histogram
DescriptionA histogram is a polygon composed of a sequence of rectangles aligned at a common base line. The rectangles have equal widths but may have different heights. For example, the figure on th翻译 2015-11-09 19:18:39 · 211 阅读 · 0 评论 -
Uva 1395
题目链接:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=105277#problem/B题意:给出一个n节点的图,边最多为n*(n-1)/2条边,求苗条度(最大边权值减最小边权值)尽量小的生成树。分析:按权值从小到大排序,从小到大枚举L,然后直到连通边数有n-1时,就枚举另一个L,保存最优值就可以了。#inc翻译 2016-01-28 17:53:09 · 283 阅读 · 0 评论 -
数轴染色
题目描述 Description在一条数轴上有N个点,分别是1~N。一开始所有的点都被染成黑色。接着我们进行M次操作,第i次操作将[Li,Ri]这些点染成白色。请输出每个操作执行后剩余黑色点的个数。输入描述 Input Description输入一行为N和M。下面M行每行两个数Li、Ri输出描述 Output Description翻译 2016-02-20 08:55:59 · 823 阅读 · 0 评论 -
HDU A Simple Problem with Integers
DescriptionLet A1, A2, ... , AN be N elements. You need to deal with two kinds of operations. One type of operation is to add a given number to a few numbers in a given interval. The other is to q翻译 2016-02-29 19:13:16 · 333 阅读 · 0 评论 -
Fire Station
描述A city is served by a number of fire stations. Some residents have complained that the distance from their houses to the nearest station is too far, so a new station is to be built. You are to c原创 2016-06-06 12:14:27 · 706 阅读 · 0 评论 -
区间众数
一、块状数组块状数组就是将数组划分若干块(一般为sqrt(n)使复杂度最低),通过预处理i~j块的答案(复杂度可以保证在n*sqrt(n)内),求答案时就根据预处理的答案和暴力枚举首尾多余个数得出最后答案,首尾多余的个数是不超过2*sqrt(n),这样总的复杂度为((n+q)sqrt(n)),q为查询的次数。二、区间众数1.题目描述有n个数x,查询q次,求【L,R】区间的众原创 2017-07-26 10:37:50 · 9286 阅读 · 2 评论 -
Hanoi Tower
DescriptionYou all must know the puzzle named "The Towers of Hanoi". The puzzle has three pegs (peg 1, peg 2 and peg 3) and N disks of different radii. Initially all disks are located on the first翻译 2015-11-11 20:06:03 · 342 阅读 · 0 评论 -
Loongint 的花篮
DescriptionLoongint 要和 MM 结婚了。在两人的走进礼堂的红地毯两侧,需要摆一些装饰用的花篮,有一些不同高度的花篮,现在这些花篮被 Loongint 依照自己的美学观念编号为S1, S2, S3 … Sn(两侧的花篮高度一样)。可 Loongint的 MM 对这些花篮的摆放方式有不同的看法,她觉得满足以下条件的花篮摆放才是最好的。如果对于区间[Si, Sj](1 ≤i<j翻译 2015-11-11 12:58:28 · 747 阅读 · 0 评论 -
诺诺的队列
题目描述诺诺表现、成绩双优,于是校长给她一笔money,让她去外地玩玩。由于本地没有飞机场,所以诺诺只能坐火车去咯。所以诺诺今天去火车站买票,却看到了N多人在火车站里啊,诺诺一阵头晕。机灵的她突然发现,有N个人在队伍里(和上文的N毫无关系- -||),人们等得很无聊,于是他们开始转来转去,想在队伍里寻找自己的熟人。队列中任意两个人A和B,如果他们是相邻或他们之间没有人比A或B高,那么他们是可以翻译 2015-11-10 17:55:21 · 447 阅读 · 0 评论 -
Optimal Programs
DescriptionAs you know, writing programs is often far from being easy. Things become even harder if your programs have to be as fast as possible. And sometimes there is reason for them to be. Many l翻译 2015-11-04 07:50:46 · 438 阅读 · 0 评论 -
Word Reversal
DescriptionFor each list of words, output a line with each word reversed without changing the order of the words.This problem contains multiple test cases!The first line of a multiple input翻译 2015-11-03 16:06:21 · 1190 阅读 · 0 评论 -
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 wa翻译 2015-11-03 17:22:27 · 279 阅读 · 0 评论 -
ACboy needs your help again!
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 ACboy o翻译 2015-11-05 09:19:47 · 654 阅读 · 0 评论 -
愚人节的礼物
Description四月一日快到了,Vayko想了个愚人的好办法――送礼物。嘿嘿,不要想的太好,这礼物可没那么简单,Vayko为了愚人,准备了一堆盒子,其中有一个盒子里面装了礼物。盒子里面可以再放零个或者多个盒子。假设放礼物的盒子里不再放其他盒子。用()表示一个盒子,B表示礼物,Vayko想让你帮她算出愚人指数,即最少需要拆多少个盒子才能拿到礼物。翻译 2015-11-04 21:34:02 · 308 阅读 · 0 评论 -
Train Problem I
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 the fas翻译 2015-11-04 22:07:21 · 142 阅读 · 0 评论 -
Anagrams by Stack
DescriptionHow can anagrams result from sequences of stack operations? There are two sequences of stack operators which can convert TROT to TORT:[ i i i i o o o o i o i i o o i o ]翻译 2015-11-05 08:57:53 · 344 阅读 · 0 评论 -
Flipper
DescriptionLittle Bobby Roberts (son of Big Bob, of Problem G) plays this solitaire memory game called Flipper. He starts withn cards, numbered 1 through n, and lays them out in a row with the c翻译 2015-11-05 16:07:45 · 326 阅读 · 0 评论 -
(Your)((Term)((Project)))
DescriptionYou have typed the report of your term project in your personal computer. There are several one line arithmetic expressions in your report. There is no redundant parentheses in the expr翻译 2015-11-04 19:23:34 · 577 阅读 · 0 评论 -
简单计算器
Description读入一个只包含 +, -, *, / 的非负整数计算表达式,计算该表达式的值。 Input测试输入包含若干测试用例,每个测试用例占一行,每行不超过200个字符,整数和运算符之间用一个空格分隔。没有非法表达式。当一行中只有0时输入结束,相应的结果不要输出。 Output对每个测试用例输出1行,即该翻译 2015-11-04 21:19:48 · 542 阅读 · 0 评论 -
Mapping the Route
DescriptionFinding a path through a maze is a popular problem for computers. In this problem, a maze will consist of a rectangular array of square cells, each of which may have walls on the north, s翻译 2015-11-06 09:43:33 · 457 阅读 · 0 评论 -
皇后问题
常见的八皇后问题采用非递归实现代码。其实加个栈保存能放在的是哪一列就行了。#include const int maxn = 35;int ans, n, stack[maxn];int is_ok ( int k ){ for ( int i = 1; i < k; i ++ ) //判断是否和前面的行列重复 if ( k-stack[k] == i翻译 2015-11-08 15:12:30 · 236 阅读 · 0 评论 -
Directory Listing
DescriptionGiven a tree of UNIX directories and file/directory sizes, you are supposed to list them as a tree with proper indention and sizes.InputThe input consists of several test cases. Eac翻译 2015-11-09 07:29:01 · 450 阅读 · 0 评论 -
BZOJ 2555: SubString
2555: SubStringTime Limit: 30 Sec Memory Limit: 512 MBSubmit: 2880 Solved: 861[Submit][Status][Discuss]Description 懒得写背景了,给你一个字符串init,要求你支持两个操作 (1):在当前字符串的后面插入一个字符串原创 2017-08-03 13:14:00 · 380 阅读 · 0 评论