数据结构
文章平均质量分 83
i-unique
擅长各种姿势划水
展开
-
HDU 1272 小希的迷宫 (并查集+图论基本知识的运用)
上次Gardon的迷宫城堡小希玩了很久(见Problem B),现在她也想设计一个迷宫让Gardon来走。但是她设计迷宫的思路不一样,首先她认为所有的通道都应该是双向连通的,就是说如果有一个通道连通了房间A和B,那么既可以通过它从房间A走到房间B,也可以通过它从房间B走到房间A,为了提高难度,小希希望任意两个房间有且仅有一条路径可以相通(除非走了回头路)。小希现在把她的设计图给你,让你帮忙判断她的设计图是否符合她的设计思路。比如下面的例子,前两个是符合条件的,但是最后一个却有两种方法从5到达8。原创 2017-07-08 15:22:53 · 361 阅读 · 0 评论 -
HDU 1358 Period(KMP+next数组的运用)
For each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefix is a periodic string. That is, for each i (2 <= i <= N) we want to know the largest K > 1 (if there i原创 2017-08-21 11:12:58 · 228 阅读 · 0 评论 -
HDU 3746 Cyclic Nacklace(KMP)
CC always becomes very depressed at the end of this month, he has checked his credit card yesterday, without any surprise, there are only 99.9 yuan left. he is too distressed and thinking about how to tide over the last days. Being inspired by the entrepre原创 2017-08-21 10:04:44 · 259 阅读 · 0 评论 -
HUST 1010 The Minimum Length(KMP)
There is a string A. The length of A is less than 1,000,000. I rewrite it again and again. Then I got a new string: AAAAAA...... Now I cut it from two different position and get a new string B. Then, give you the string B, can you tell me the length of the原创 2017-08-21 14:30:02 · 272 阅读 · 0 评论 -
HDU 2609 How many(最小表示法)
Give you n ( n < 10000) necklaces ,the length of necklace will not large than 100,tell me How many kinds of necklaces total have.(if two necklaces can equal by rotating ,we say the two necklaces are some). For example 0110 express a necklace, you can rot原创 2017-08-23 16:22:19 · 291 阅读 · 0 评论 -
POJ 2406 Power Strings(KMP+最小循环节)
Given two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of concatenation as multiplication, exponentiation by a non-negative integer is defined in the normal way: a^0 = ""原创 2017-08-21 15:14:33 · 318 阅读 · 0 评论 -
POJ 2752 Seek the Name, Seek the Fame(KMP+next数组的运用)
The little cat is so famous, that many couples tramp over hill and dale to Byteland, and asked the little cat to give names to their newly-born babies. They seek the name, and at the same time seek the fame. In order to escape from such boring job, the inn原创 2017-08-21 15:32:08 · 305 阅读 · 0 评论 -
HDU 3336 Count the string(KMP+稍微DP+next数组的运用)
It is well known that AekdyCoin is good at string problems as well as number theory problems. When given a string s, we can write down all the non-empty prefixes of this string. For example: s: "abab" The prefixes are: "a", "ab", "aba", "abab" For each原创 2017-08-21 19:28:16 · 239 阅读 · 0 评论 -
HDU 2594 Simpsons’ Hidden Talents(KMP)
Homer: Marge, I just figured out a way to discover some of the talents we weren’t aware we had. Marge: Yeah, what is it? Homer: Take me for example. I want to find out if I have a talent in politics, OK? Marge: OK. Homer: So I take some politician’s na原创 2017-08-21 19:09:27 · 232 阅读 · 0 评论 -
HDU 4300 Clairewd’s message(扩展KMP)
Clairewd is a member of FBI. After several years concealing in BUPT, she intercepted some important messages and she was preparing for sending it to ykwd. They had agreed that each letter of these messages would be transfered to another one according to a原创 2017-08-21 20:57:33 · 300 阅读 · 0 评论 -
POJ 3145Harmony Forever(线段树更新+分情况处理数据+区间极值查询+好题)
We believe that every inhabitant of this universe eventually will find a way to live together in harmony and peace; that trust, patience, kindness and loyalty will exist between every living being of this earth; people will find a way to appreciate and coo原创 2017-08-18 20:34:16 · 469 阅读 · 0 评论 -
HDU 1543 Paint the Wall(离散化+暴力)
Here comes our future artist. See, he is painting again, this time on home's white wall, using different color of paint. Let me see, red, yellow, black, green... but why does he just paint rectangles? Pretty guy, seems he is fond of it.So, after he's done原创 2017-08-17 20:20:47 · 555 阅读 · 0 评论 -
ZOJ 3453 Doraemon's Sweet Bullet(线段树区间更新+单点更新+最值询问)
Doraemon likes to shoot his enemies with sweet bullets.n "enemies" stand in a line, each with a life value li (the index i increases from left to right side and starts from 1). Each time Doraemon shoots a sweet bullet from the right side. The ith bullet h原创 2017-08-17 19:53:11 · 229 阅读 · 0 评论 -
HDU 1213 How Many Tables (并查集炒鸡入门题)
Today is Ignatius' birthday. He invites a lot of friends. Now it's dinner time. Ignatius wants to know how many tables he needs at least. You have to notice that not all the friends know each other, and all the friends do not want to stay with strangers.原创 2017-07-08 14:41:39 · 415 阅读 · 0 评论 -
POJ 2777 Count Color (线段树的区间更新+lazy tag)
Chosen Problem Solving and Program design as an optional course, you are required to solve all kinds of problems. Here, we get a new problem. There is a very long board with length L centimeter, L is a positive integer, so we can evenly divide the board原创 2017-07-08 13:51:11 · 326 阅读 · 0 评论 -
Codeforces 25 D.Roads not only in Berland(并查集)
Berland Government decided to improve relations with neighboring countries. First of all, it was decided to build new roads so that from each city of Berland and neighboring countries it became possible to reach all the others. There are n cities in Berlan原创 2017-07-06 20:57:36 · 357 阅读 · 0 评论 -
蓝桥杯 操作格子(线段树的更新)
有n个格子,从左到右放成一排,编号为1-n。共有m次操作,有3种操作类型:1.修改一个格子的权值,2.求连续一段格子权值和,3.求连续一段格子的最大值。对于每个2、3操作输出你所求出的结果。原创 2017-07-05 21:19:19 · 352 阅读 · 0 评论 -
POJ 3667 Hotel(线段树的合并+lazy tag)【很详细!!】
The cows are journeying north to Thunder Bay in Canada to gain cultural enrichment and enjoy a vacation on the sunny shores of Lake Superior. Bessie, ever the competent travel agent, has named the Bullmoose Hotel on famed Cumberland Street as their vacatio原创 2017-07-04 10:20:25 · 1035 阅读 · 2 评论 -
HDU 1394 Minimum Inversion Number(求逆序对+线段树||归并排序)
The inversion number of a given number sequence a1, a2, ..., an is the number of pairs (ai, aj) that satisfy i < j and ai > aj.For a given sequence of numbers a1, a2, ..., an, if we move the first m >= 0 numbers to the end of the seqence, we will obtain原创 2017-07-03 18:41:30 · 371 阅读 · 0 评论 -
HDU 1166 敌兵布阵(线段树查询+单点更新)
C国的死对头A国这段时间正在进行军事演习,所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监测手段,所以每个工兵营地的人数C国都掌握的一清二楚,每个工兵营地的人数都有可能发生变动,可能增加或减少若干人手,但这些都逃不过C国的监视。中央情报局要研究敌人究竟演习什么战术,所以Tidy要随时向Derek汇报某一段连续的工兵营地一共有多少人,例如Derek问:“Tidy,马上汇报第3个营地原创 2017-07-03 10:45:49 · 395 阅读 · 0 评论 -
HDU-1255 覆盖的面积(线段树扫描线模板+离散化+加点修改题)
给定平面上若干矩形,求出被这些矩形覆盖过至少两次的区域的面积.原创 2017-08-16 17:13:06 · 418 阅读 · 0 评论 -
HDU-1255 覆盖的面积(线段树扫描线+离散化+改进后超快的算法)
给定平面上若干矩形,求出被这些矩形覆盖过至少两次的区域的面积.原创 2017-08-17 10:09:09 · 513 阅读 · 0 评论 -
HDU 2328 Corporate Identity(发现新大陆之KMP专题不用KMP也能过系列)
Beside other services, ACM helps companies to clearly state their “corporate identity”, which includes company logo but also other signs, like trademarks. One of such companies is Internet Building Masters (IBM), which has recently asked ACM for a help wit原创 2017-08-23 10:56:31 · 396 阅读 · 0 评论 -
HDU 6186 CS Course(线段树区间操作)
Little A has come to college and majored in Computer and Science. Today he has learned bit-operations in Algorithm Lessons, and he got a problem as homework. Here is the problem: You are giving n non-negative integers a1,a2,⋯,ana1,a2,⋯,an, and some q原创 2017-09-05 14:48:41 · 353 阅读 · 0 评论 -
codeforces 315 B.Sereja and Array(线段树区间更新+单点更新+单点询问)
Sereja has got an array, consisting of n integers, a1, a2, ..., an. Sereja is an active boy, so he is now going to complete m operations. Each operation will have one of the three forms:Make vi-th array element equal to xi. In other words, perform the ass原创 2017-10-29 19:40:31 · 417 阅读 · 0 评论 -
Codeforces 276C Little Girl and Maximum Sum(线段树的区间更新)
The little girl loves the problems on array queries very much.One day she came across a rather well-known problem: you've got an array of nelements (the elements of the array are indexed starting from 1); also, there are qqueries, each one is defined by a原创 2017-10-22 20:25:15 · 405 阅读 · 0 评论 -
Codeforces Round #149 (Div. 2) E. XOR on Segment(21棵线段树处理每一位+区间异或)
You've got an array a, consisting of n integers a1, a2, ..., an. You are allowed to perform two operations on this array:Calculate the sum of current array elements on the segment [l, r], that is, count value al + al + 1 + ... + ar.Apply the xor operatio原创 2017-10-15 20:34:50 · 385 阅读 · 0 评论 -
WUSTOJ 1643 WEB浏览器(栈的使用)
模拟一个网页浏览的过程,给出起始页面,有三种命令:(1)VISIT url:访问某URL,当前页面变为该URL。并且清空此页面后的所有浏览页面。(2)BACK:后退,倒退到前一个网页(3)FORWARD:前进,同理如上(4)QUIT:退出,结束整个命令输入,这一行输入不用做任何处理,结束程序即可假定浏览器最初的访问页面为:http://acm.wust.edu.cn/原创 2017-11-06 13:00:18 · 1228 阅读 · 0 评论 -
实验1 链表的插入和删除
【实验内容】设有两个无头结点的单链表,分别为ha,hb,其链中有数据域data,链域next,两链表的数据都按递增序存放。现要求将hb表归到ha表中,且归并后ha仍按递增排序,归并中ha表中已有的数据若与hb相同,则hb中的数据不归并到ha中,hb的链表在算法中不允许破坏。 【实验目的】1、 了解单链表、循环链表和双链表的基本知识;2、 掌握算法思想和数据结构的描述;3、 掌握链表的插入、删除的相关语句及基本方法。 【实验步骤与要求】1、 实验前的准备(1) 了解C语言的基本概念;(2原创 2017-11-23 18:30:13 · 1849 阅读 · 0 评论 -
实验2 一元多项式相加
【实验内容】结合书上第41页的例子,采用链式存储结构,将两个线性链表表示的一元多项式相加,并输出。此一元多项式遵循多项式相加运算规则:对于两个一元多项式中存在指数相同的项时,其对应系数相加。合并后系数和为零时,删除“和多项式”中此项;合并后系数和不为零时,则构成“和多项式”中的一项。对于两个一元多项式中存在的指数不相同的项,则分别复抄到“和多项式”中去,原多项式保持不变。原创 2017-12-05 13:52:24 · 2044 阅读 · 0 评论 -
实验3 二叉树的遍历
创建一个二叉树,对这棵动态二叉树进行分析,将其用静态二叉链表表示。二叉树的动态二叉链表结构中的每个结点有三个字段:data,lchild,rchild。静态二叉链表是用数组作为存储空间,每个数组元素存储二叉树的一个结点,也有三个字段:data,lchild,rchild。lchild和rdhild分别用于存储左右孩子的下标。原创 2017-12-07 13:44:43 · 1783 阅读 · 4 评论 -
实验4 无向图的深度优先搜索
实验4 无向图的深度优先搜索【实验内容】设无向图G有n个点e条边,写一算法建立无向图G的邻接表,并按照深度优先搜索输出顶点。【实验目的】1、了解图的定义、特点,区分无向图和有向图的概念;2、了解图的数据结构和搜索方法;3、掌握无向图的邻接矩阵、邻接表的表示方法;4、写出无向图的深度优先搜索程序。【实验步骤与要求】1、了解图的定义、特点,区分无向图和有向图的概念;2、了解图的数据结构和搜索方法;3、掌握无向图的邻接矩阵、邻接表的表示方法;4、写出无向图的深度优先搜索程序。原创 2017-12-19 14:26:42 · 1455 阅读 · 0 评论 -
实验5 结合二叉树的二叉排序树设计
实验5 结合二叉树的二叉排序树设计【实验内容】二叉排序树采用二叉链表存储。写一个算法,删除结点值是X的结点。要求删除该结点后,此树仍然是一棵二叉排序树,并且高度没有增长(注:可不考虑被删除的结点是根的情况)。【实验目的】1、了解二叉排序树的定义,并结合二叉树的数据结构;2、掌握二叉排序树的排序方法。【实验步骤与要求】1、了解二叉排序树的定义,并结合二叉树的数据结构;2、掌握二叉排序树的排序方法。原创 2017-12-19 14:28:35 · 1153 阅读 · 0 评论 -
HDU 5493 Queue(树状数组+二分)
NN people numbered from 1 to NN are waiting in a bank for service. They all stand in a queue, but the queue never moves. It is lunch time now, so they decide to go out and have lunch first. When they get back, they don’t remember the exact order of the que原创 2017-09-12 21:32:43 · 347 阅读 · 0 评论 -
HDU 5510 Bazinga(KMP||strstr神器+些许优化)
Ladies and gentlemen, please sit up straight. Don't tilt your head. I'm serious.For nn given strings S1,S2,⋯,SnS1,S2,⋯,Sn, labelled from 11 to nn, you should find the largest i (1≤i≤n)i (1≤i≤n) such that there exists an integer j (1≤j<i)j (1≤j<i) and SjS原创 2017-09-26 21:22:26 · 592 阅读 · 0 评论 -
2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 F. Overlapping Rectangles(扫描线)
There are nn rectangles on the plane. The problem is to find the area of the union of these rectangles. Note that these rectangles might overlap with each other, and the overlapped areas of these rectangles shall not be counted more than once. For example,原创 2017-09-24 16:57:25 · 458 阅读 · 0 评论 -
HDU 3374 String Problem(最大最小表示法模板+KMP+next数组的运用)
Give you a string with length N, you can generate N strings by left shifts. For example let consider the string “SKYLONG”, we can generate seven strings: String Rank SKYLONG 1 KYLONGS 2 YLONGSK 3 LONGSKY 4 ONGSKYL 5 NGSKYLO 6 GSKYLON 7 and lexicog原创 2017-08-23 15:27:26 · 540 阅读 · 0 评论 -
ZOJ 1729 Hidden Password(最小表示法模板题)
Some time the programmers have very strange ways to hide their passwords. See for example how Billy "Hacker" Geits hide his password. Billy chooses a string S composed of small Latin letters with length L. Then he makes all L-1 one-letter left cyclic shift原创 2017-08-24 09:53:01 · 328 阅读 · 0 评论 -
HDU 6153 A Secret(扩展KMP+数学推导)
Today is the birthday of SF,so VS gives two strings S1,S2 to SF as a present,which have a big secret.SF is interested in this secret and ask VS how to get it.There are the things that VS tell: Suffix(S2,i) = S2[i...len].Ni is the times that Suffix(S2,i)原创 2017-08-28 15:24:38 · 305 阅读 · 0 评论 -
HDU 3613 Best Reward(扩展KMP模板)
After an uphill battle, General Li won a great victory. Now the head of state decide to reward him with honor and treasures for his great exploit. One of these treasures is a necklace made up of 26 different kinds of gemstones, and the length of the neck原创 2017-08-28 14:27:04 · 252 阅读 · 0 评论