数据结构
BYSora
这个作者很懒,什么都没留下…
展开
-
Lightoj1113——Discover the Web(STL,栈的使用)
Standard 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 that can be re原创 2016-04-18 13:59:27 · 859 阅读 · 0 评论 -
poj1840——Eqs(哈希)
DescriptionConsider equations having the following form: a1x13+ a2x23+ a3x33+ a4x43+ a5x53=0 The coefficients are given integers from the interval [-50,50]. It is consider a solution a system (x1原创 2017-02-10 18:17:08 · 712 阅读 · 0 评论 -
poj3349——Snowflake Snow Snowflakes(hash表)
DescriptionYou may have heard that no two snowflakes are alike. Your task is to write a program to determine whether this is really true. Your program will read information about a collection of snowfl原创 2017-01-21 14:51:11 · 734 阅读 · 0 评论 -
poj1442——Black Box(优先队列)
DescriptionOur Black Box represents a primitive database. It can save an integer array and has a special i variable. At the initial moment Black Box is empty and i equals 0. This Black Box processes a原创 2017-02-12 11:52:46 · 739 阅读 · 0 评论 -
蓝桥杯算法训练——区间k大数查询 (优先队列)
问题描述 给定一个序列,每次询问序列中第l个数到第r个数中第K大的数是哪个。输入格式 第一行包含一个数n,表示序列长度。第二行包含n个正整数,表示给定的序列。第三个包含一个正整数m,表示询问个数。接下来m行,每行三个数l,r,K,表示询问序列从左往右第l个数到第r个数中,从大往小第K大的数是哪个。序列元素从1开始标号。输出格式 总共输出m行,每行一个数,表示询问的答案。 样例输入 5 1原创 2017-03-03 16:52:39 · 738 阅读 · 0 评论 -
蓝桥杯算法训练——字符统计
问题描述 给定一个长度为n的字符串S,还有一个数字L,统计长度大于等于L的出现次数最多的子串(不同的出现可以相交),如果有多个,输出最长的,如果仍然有多个,输出第一次出现最早的。 输入格式 第一行一个数字L。 第二行是字符串S。 L大于0,且不超过S的长度。 输出格式 一行,题目要求的字符串。 输入样例1: 4 bbaabbaaaaa 输出样例1:原创 2017-03-03 18:33:55 · 843 阅读 · 0 评论 -
蓝桥杯算法提高——盾神与条状项链(链表)
问题描述 有一天,盾神捡到了好多好多五颜六色的珠子!他心想这些珠子这么漂亮,可以做成一条项链然后送给他心仪的女生~于是他用其中一些珠子做成了长度为n的项链。当他准备把项链首尾相接的时候,土方进来了。 “哇这么恶心的项链你也做得出来!!!” 盾神自知审美不是他的长项,于是他很谦虚地请教土方,怎么才能把项链做得漂亮。 “这个嘛~首先你要在这里加上一个这种颜色的珠子,然后在这里去掉原创 2017-03-31 17:48:03 · 553 阅读 · 1 评论 -
poj2342——Anniversary party(树形dp)
DescriptionThere is going to be a party to celebrate the 80-th Anniversary of the Ural State University. The University has a hierarchical structure of employees. It means that the supervisor relation原创 2017-03-31 21:24:33 · 574 阅读 · 0 评论 -
hdu1520——Anniversary party(树形dp)
Problem Description There is going to be a party to celebrate the 80-th Anniversary of the Ural State University. The University has a hierarchical structure of employees. It means that the supervisor原创 2017-04-01 19:59:29 · 737 阅读 · 0 评论 -
hdu5059——Help him(字符串处理)
Problem Description As you know, when you want to hack someone’s program, you must submit your test data. However sometimes you will submit invalid data, so we need a data checker to check your data.原创 2017-04-02 16:15:22 · 807 阅读 · 0 评论 -
poj3687——Labeling Balls(拓扑排序)
DescriptionWindy has N balls of distinct weights from 1 unit to N units. Now he tries to label them with 1 to N in such a way that:No two balls share the same label. The labeling satisfies several con原创 2017-02-10 16:54:26 · 962 阅读 · 0 评论 -
poj2299——Ultra-QuickSort(归并排序)
DescriptionIn this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence elements until the sequence i原创 2017-01-19 20:29:24 · 782 阅读 · 0 评论 -
hdu2072——单词数(STL,set)
Problem Description lily的好朋友xiaoou333最近很空,他想了一件没有什么意义的事情,就是统计一篇文章里不同单词的总数。下面你的任务是帮助xiaoou333解决这个问题。Input 有多组数据,每组一行,每组就是一篇小文章。每篇小文章都是由小写字母和空格组成,没有标点符号,遇到#时表示输入结束。Output 每组只输出一个整数,其单独成行,该整数代表一篇文章里不同单原创 2016-05-04 20:46:57 · 826 阅读 · 0 评论 -
POJ1579——Function Run Fun(记忆化递归)
Function Run Fun Time Limit : 2000/1000ms (Java/Other) Memory Limit : 20000/10000K (Java/Other) Total Submission(s) : 26 Accepted Submission(s) : 14 Problem Description We all love rec原创 2015-10-31 11:20:30 · 522 阅读 · 0 评论 -
poj1068——Parencodings
DescriptionLet S = s1 s2…s2n be a well-formed string of parentheses. S can be encoded in two different ways: q By an integer sequence P = p1 p2…pn where pi is the number of left parentheses before原创 2016-06-02 12:48:57 · 953 阅读 · 0 评论 -
poj1330——Nearest Common Ancestors(最近公共祖先)
Description A rooted tree is a well-known data structure in computer science and engineering. An example is shown below: In the figure, each node is labeled with an integer from {1, 2,...,16}原创 2016-01-21 16:42:56 · 829 阅读 · 0 评论 -
UVA11488——Hyper Prefix Sets(字典树,最长前缀)
Prefix goodness of a set string is length of longest common prefix*number of strings in the set. For example the prefix goodness of the set {000,001,0011} is 6.You are given a set of binary strings. Fin原创 2015-11-05 19:48:32 · 1258 阅读 · 0 评论 -
hdu1425——sort
Problem Description 给你n个整数,请按从大到小的顺序输出其中前m大的数。 Input 每组测试数据有两行,第一行有两个数n,m(0 Output 对每组测试数据按从大到小的顺序输出前m大的数。 Sample Input 5 3 3 -35 92 213 -644 Sample Output 213 92 3原创 2015-05-27 22:47:37 · 726 阅读 · 0 评论 -
poj3295——Tautology(构造法)
DescriptionWFF ‘N PROOF is a logic game played with dice. Each die has six faces representing some subset of the possible symbols K, A, N, C, E, p, q, r, s, t. A Well-formed formula (WFF) is any string原创 2016-12-16 17:35:48 · 919 阅读 · 0 评论 -
poj1094——Sorting It All Out(拓扑排序)
DescriptionAn ascending sorted sequence of distinct values is one in which some form of a less-than operator is used to order the elements from smallest to largest. For example, the sorted sequence A,原创 2017-01-18 19:29:32 · 747 阅读 · 0 评论 -
poj3080——Blue Jeans(字串)
DescriptionThe Genographic Project is a research partnership between IBM and The National Geographic Society that is analyzing DNA from hundreds of thousands of contributors to map how the Earth was po原创 2017-01-19 14:03:34 · 581 阅读 · 0 评论 -
poj2002——Squares(hash)
DescriptionA square is a 4-sided polygon whose sides have equal length and adjacent sides form 90-degree angles. It is also a polygon such that rotating about its centre by 90 degrees gives the same po原创 2017-04-11 18:15:50 · 1000 阅读 · 0 评论