数据结构
so_so_y
start to record bugs <- so hard so brave
展开
-
POJ 2503 Babelfish(STL、二分、字典树、哈希)
DescriptionYou have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language. Fortunately, you have a dictionary to help you understand them.Input原创 2017-08-09 20:58:41 · 1308 阅读 · 0 评论 -
CodeForces 714C Sonya and Queries(字典树/思维)
DescriptionToday Sonya learned about long integers and invited all her friends to share the fun. Sonya has an initially empty multiset with integers. Friends give her t queries, each of one of the f...原创 2018-03-19 20:26:24 · 207 阅读 · 0 评论 -
FZU 2219 StarCraft(贪心+优先队列)
Problem DescriptionZB loves playing StarCraft and he likes Zerg most!One day, when ZB was playing SC2, he came up with an idea:He wants to change the queen’s ability, the queen’s new ability is ...原创 2018-02-15 20:22:21 · 368 阅读 · 0 评论 -
51nod 1117 聪明的木匠 (贪心+优先队列)
Description一位老木匠需要将一根长的木棒切成N段。每段的长度分别为L1,L2,……,LN(1 <= L1,L2,…,LN <= 1000,且均为整数)个长度单位。我们认为切割时仅在整数点处切且没有木材损失。 木匠发现,每一次切割花费的体力与该木棒的长度成正比,不妨设切割长度为1的木棒花费1单位体力。例如:若N=3,L1 = 3,L2 = 4,L3 = 5,则木棒原长为1...原创 2018-02-15 19:17:34 · 378 阅读 · 0 评论 -
51nod 1277 字符串中的最大值(kmp)
Description一个字符串的前缀是指包含该字符第一个字母的连续子串,例如:abcd的所有前缀为a, ab, abc, abcd。 给出一个字符串S,求其所有前缀中,字符长度与出现次数的乘积的最大值。 例如:S = “abababa” 所有的前缀如下:“a”, 长度与出现次数的乘积 1 * 4 = 4, “ab”,长度与出现次数的乘积 2 * 3 = 6, “aba”, 长度与出现次数的原创 2017-11-15 20:36:54 · 263 阅读 · 0 评论 -
ZOJ 1610 Count the Colors(线段树区间染色)
DescriptionPainting some colored segments on a line, some previously painted segments may be covered by some the subsequent ones. Your task is counting the segments of different colors you can see at原创 2017-11-19 18:34:24 · 203 阅读 · 0 评论 -
HDU 1698 Just a Hook(线段树区间更新+区间求和+染色问题)
Problem DescriptionIn the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecutive metallic sticks which are of the same le原创 2017-11-19 18:20:02 · 238 阅读 · 0 评论 -
POJ 3468 A Simple Problem with Integers(线段树区间更新+区间求和)
DescriptionYou have N integers, A1, A2, … , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given interval. The other is to ask原创 2017-11-19 18:01:46 · 186 阅读 · 0 评论 -
HDU 1754 I Hate It(线段树单点更新+区间求最值)
Problem Description很多学校流行一种比较的习惯。老师们很喜欢询问,从某某到某某当中,分数最高的是多少。 这让很多学生很反感。不管你喜不喜欢,现在需要你做的是,就是按照老师的要求,写一个程序,模拟老师的询问。当然,老师有时候需要更新某位同学的成绩。Input本题目包含多组测试,请处理到文件结束。 在每个测试的第一行,有两个正整数 N 和 M ( 0Output对于每一次询问操作,原创 2017-11-19 17:51:57 · 178 阅读 · 0 评论 -
HDU 1166 敌兵布阵(线段树单点更新+区间求和)
Problem DescriptionC国的死对头A国这段时间正在进行军事演习,所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监测手段,所以每个工兵营地的人数C国都掌握的一清二楚,每个工兵营地的人数都有可能发生变动,可能增加或减少若干人手,但这些都逃不过C国的监视。 中央原创 2017-11-19 17:41:39 · 178 阅读 · 0 评论 -
POJ 1330 Nearest Common Ancestors(LCA)
DescriptionA 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}. Node 8原创 2017-10-01 18:43:50 · 188 阅读 · 0 评论 -
HDU 6153 A Secret(扩展KMP)
Problem DescriptionToday 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 tha原创 2017-08-21 18:17:57 · 568 阅读 · 0 评论 -
HDU 3695 Computer Virus on Planet Pandora and HDU 2896 病毒侵袭(AC自动机裸题)
题目大意都是给出几个病毒模式串,然后再给一个串看其中有多少个病毒,不同的是3695要求将串反转一次,2896是对于每个网站按照标号顺序输出含有的病毒串和含有病毒的网站总数。解题思路都是按照给的病毒模式串建立AC自动机,3695将串正向和反向均匹配一次,2896是将记录每个匹配到的字符串然后按照标号顺序输出,注意要对已经匹配到的病毒串进行标记,避免重复计数。 另外我的代码G++MLE,C++AC。初原创 2017-08-24 21:44:47 · 258 阅读 · 0 评论 -
POJ 2777 Count Color(线段树+懒惰标记)
DescriptionChosen 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 centime原创 2017-08-14 20:35:17 · 323 阅读 · 0 评论 -
POJ 2558 Mayor's posters(线段树+离散化+区间更新)
DescriptionThe citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral posters at all places at their whim. The city council has原创 2017-08-14 09:44:05 · 265 阅读 · 0 评论 -
POJ 2828 Buy Tickets(线段树)
DescriptionRailway tickets were difficult to buy around the Lunar New Year in China, so we must get up early and join a long queue…The Lunar New Year was approaching, but unluckily the Little Cat still原创 2017-08-14 15:15:48 · 259 阅读 · 0 评论 -
POJ 1195 Mobile phones(二维树状数组)
DescriptionSuppose that the fourth generation mobile phone base stations in the Tampere area operate as follows. The area is divided into squares. The squares form an S * S matrix with the rows and col原创 2017-08-11 17:48:05 · 273 阅读 · 0 评论 -
POJ 3321 Apple Tree(树状数组+DFS构建)
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.The tre原创 2017-08-11 15:39:43 · 460 阅读 · 0 评论 -
51nod 1521 一维战舰(二分)
题目描述爱丽丝和鲍博喜欢玩一维战舰的游戏。他们在一行有n个方格的纸上玩这个游戏(也就是1×n的表格)。在游戏开始的时候,爱丽丝放k个战舰在这个表格中,并不把具体位置告诉鲍博。每一只战舰的形状是 1×a 的长方形(也就是说,战舰会占据a个连续的方格)。这些战舰不能相互重叠,也不能相接触。然后鲍博会做一系列的点名。当他点到某个格子的时候,爱丽丝会告诉他那个格子是否被某只战舰占据。如果是,就...原创 2018-04-06 18:34:33 · 188 阅读 · 0 评论