数据结构
Wang_SF2015
这个作者很懒,什么都没留下…
展开
-
文章标题 codeforces 115A:Party ( 并查集)
PartyDescriptionA company has n employees numbered from 1 to n. Each employee either has no immediate manager or exactly one immediate manager, who is another employee with a different number. An emplo原创 2016-08-18 15:50:20 · 359 阅读 · 0 评论 -
文章标题 CSU 1831: Found(矩阵快速幂)
1831: Found链接 1831: Found 题意:有n个点,从1到n编号,有两个人A,B,A在第1个点,B在第n个点,然后有时间T,每一分钟,A,B都走到邻接的点上去,且在T的时间内不能走到同一点,然后问在第T的时间刚好走到同一点的方式有多少,得到的结果mod9973 分析:由于最多只有10个点,所以可以用0~9来表示当前的位置,然后有两个人,就可以用一个两位数来表示当前两个人的位置,最原创 2017-04-06 14:35:02 · 343 阅读 · 0 评论 -
文章标题 CSU 1845: Sensor network (暴力LCA+kruskal思想)
1845: Sensor network链接 1845: Sensor network 题意: 给出一些传感器以及他们连接起来的网络,每个传感器都有其额 定电压,要求通过的电压只能高不能低。现在只能在一个传感器 上施加电压,然后问如果要使得网络中的每个点都能够有电,这 样的一个网络中各个传感器之间的极差最小是多少。 分析:很显然的,要使得网络中的每一个点都连通电,必须要连上n-1条边。然后原创 2017-04-19 17:07:26 · 178 阅读 · 0 评论 -
文章标题 CSU 1913 (线段树+二分答案)
CSU 1913题目 链接题意:中文题 分析:首先由于只关心最后的结果,所以op2相当于简单的撤销之前的p个op1的操作,用一个栈模拟一下即可,这样我们就能得到一个只有 op1的操作序列。 再对于保存下的只有 op1 的操作序列,对答案二分,设为 ans 。将数组中大于 ans 的数设为1,小于等于 ans 的数设为0,存到线段树中,然后每个操作 [l,r] 就变成了如下步骤原创 2017-05-31 19:57:04 · 506 阅读 · 0 评论 -
文章标题 HDU 1540 : Tunnel Warfare (线段树+最大连续区间)
Tunnel WarfareDuring the War of Resistance Against Japan, tunnel warfare was carried out extensively in the vast areas of north China Plain. Generally speaking, villages connected by tunnels lay in a l原创 2017-06-30 11:53:24 · 332 阅读 · 0 评论 -
文章标题 POJ 1236 : Network of Schools (强联通分量+缩点)
Network of SchoolsA number of schools are connected to a computer network. Agreements have been developed among those schools: each school maintains a list of schools to which it distributes software (原创 2017-06-30 12:10:38 · 338 阅读 · 0 评论 -
文章标题 POJ 2559 : Largest Rectangle in a Histogram (单调栈)
Largest Rectangle in a HistogramA 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原创 2017-07-11 15:52:51 · 164 阅读 · 0 评论 -
文章标题 CSU 1838: Water Pump (单调栈)
1838: Water Pump链接 1838: Water Pump 题意:给出n堵墙(水坝?),已知各个墙的高度hi。 这些墙之间灌满了水,当然这些水都是符合 物理规律的,即不会漂浮在空中。然后问如 果在两堵墙之间开一个洞,那么最多可以流 出多少水? 分析:要求出第i堵墙和i+1堵墙流出的水量,可以计算出左边的前缀和面积dpl[i],然后计算右边的后缀和面积dpr[i],然后用总面积原创 2017-04-19 15:56:01 · 320 阅读 · 0 评论 -
文章标题 POJ : 3233 Matrix Power Series (矩阵快速幂+求等比矩阵的和)
Matrix Power Series//http://www.cnblogs.com/jiangjing/archive/2013/05/28/3103336.html/*分析:求a^1+..a^n这是矩阵乘法中关于等比矩阵的求法:|A E||0 E|其中的A为m阶矩阵,E是单位矩阵,0是零矩阵。而我们要求的是:转载 2017-07-08 17:46:43 · 317 阅读 · 0 评论 -
文章标题 POJ 3468 : A Simple Problem with Integers (线段树)
A Simple Problem with IntegersYou 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. T原创 2017-07-12 16:17:10 · 117 阅读 · 0 评论 -
文章标题 HDU 3530 : Subsequence(单调队列)
SubsequenceThere is a sequence of integers. Your task is to find the longest subsequence that satisfies the following condition: the difference between the maximum element and the minimum element of th原创 2017-07-19 14:45:47 · 535 阅读 · 0 评论 -
文章标题 SPOJ - DRUIDEOI : Fata7y Ya Warda!(单调栈)
Fata7y Ya Warda!Druid (AKA Amr Alaa El-Deen) and little EOIers have finished their training and they are playing “Fatta7y ya warda!”. It’s a kids game when everyone holds hands with two other kids form原创 2017-07-19 15:13:31 · 389 阅读 · 0 评论 -
文章标题 HDU 3410 : Passing the Message (单调栈)
Passing the MessageWhat a sunny day! Let’s go picnic and have barbecue! Today, all kids in “Sun Flower” kindergarten are prepared to have an excursion. Before kicking off, teacher Liu tells them to sta原创 2017-07-19 15:31:58 · 397 阅读 · 0 评论 -
文章标题 HihoCoder - 1080 : 更为复杂的买卖房屋姿势(线段树)
更为复杂的买卖房屋姿势描述小Hi和小Ho都是游戏迷,“模拟都市”是他们非常喜欢的一个游戏,在这个游戏里面他们可以化身上帝模式,买卖房产。在这个游戏里,会不断的发生如下两种事件:一种是房屋自发的涨价或者降价,而另一种是政府有关部门针对房价的硬性调控。房价的变化自然影响到小Hi和小Ho的决策,所以他们希望能够知道任意时刻某个街道中所有房屋的房价总和是多少——但是很不幸的,游戏本身并不提供这样的计算。不过原创 2017-07-19 16:17:33 · 381 阅读 · 0 评论 -
文章标题 HDU 1533 : Going Home (最小费用最大流)
Going Home题目链接 题意:在n*m的矩形上,有房子和人, 人到达房子的话费是曼哈顿距离,然后每个人走到一个房子,求最小的费用。 分析:最小费用最大流的模板 代码:#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <queue>#include <set>#inc原创 2017-08-16 11:50:55 · 137 阅读 · 0 评论 -
文章标题 POJ 2104: K-th Number(主席树)
题目 传送门思路参考自http://www.cnblogs.com/zyf0163/p/4749042.html 代码:////http://www.cnblogs.com/zyf0163/p/4749042.html//#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <q原创 2017-08-14 16:48:14 · 277 阅读 · 0 评论 -
文章标题 SPOJ-COT - Count on a tree(LCA+主席树)
题目 链接题意:求树上的路径 u->v上第k小的节点分析:普通的第K大,当前的这颗线段树是在前面一颗线段树的基础上建立的,而树上的第K大,当前的线段树可以在其父节点的线段树建立起来。所以我们查询u->v上的第k大就是rt[u]+rt[v]-rt[lca(u,v)]-rt[fa[lca(u,v)]]的第k大。代码:#include <iostream>#include <cstdio>#inclu原创 2017-08-14 16:58:42 · 325 阅读 · 0 评论 -
文章标题 CSU 1834: Oil(欧拉路径)
1834: Oil链接 1834: Oil 题意:Mike的车会漏油,所以开车经过的路径会有一条油 的路径。现在给出油的所有路径,问这些“油路” 是否是Mike一个人走的。约定Mike除了起始点外不 能停在任意一点,但可以重复经过某一点。判断路 径是否是Mike一个人走的。 分析:油滴落的路径相当于一条无向边,那么所有的路径 组合在一起就构成了一幅无向图,题目相当于问是 否能够找到一条路径使得经原创 2017-03-31 00:31:37 · 331 阅读 · 0 评论 -
文章标题 CSU 1817 : Bones’s Battery(Floyd+二分)
1817: Bones’s Battery1817: Bones’s Battery 题意:有n个点m每条边的无向带权图,从点ui到vi需要花费电量di,要求对任一起点s到终点e,都能通过充电并且充电的次数不超过k次(在任何一个点都可以充满电)互相到达,问电池的容量最小是多少。 分析:这是我遇到的第一道二分答案,所以一开始不知道怎么做,看了标程后恍然大悟。。 首先,已经明确二分答案了,原创 2017-03-30 00:12:35 · 340 阅读 · 0 评论 -
文章标题 coderforces 761B : Dasha and friends(KMP)
Dasha and friendsRunning with barriers on the circle track is very popular in the country where Dasha lives, so no wonder that on her way to classes she saw the following situation:The track is the cir原创 2017-02-02 15:16:48 · 185 阅读 · 0 评论 -
文章标题 POJ 2349:Arctic Network ( 最小生成树Kruskal算法+并查集)
Arctic NetworkDescriptionThe Department of National Defence (DND) wishes to connect several northern outposts by a wireless network. Two different communication technologies are to be used in establish原创 2016-08-18 16:17:25 · 511 阅读 · 0 评论 -
文章标题 HDU 1800:Flying to the Mars(字典树)
Flying to the MarsDescriptionIn the year 8888, the Earth is ruled by the PPF Empire . As the population growing , PPF needs to find more land for the newborns . Finally , PPF decides to attack Kscinow原创 2016-08-09 08:36:20 · 384 阅读 · 0 评论 -
文章标题 csu1333 :Funny Car Racing(最短路 spfa)
Funny Car RacingDescriptionThere is a funny car racing in a city with n junctions and m directed roads. The funny part is: each road is open and closed periodically. Each road is associate with two int原创 2016-09-03 23:23:14 · 603 阅读 · 0 评论 -
文章标题 POJ 3253 : Fence Repair(哈夫曼)
Fence RepairDescription Farmer John wants to repair a small length of the fence around the pasture. He measures the fence and finds that he needs N (1 ≤ N ≤ 20,000) planks of wood, each having some in原创 2016-11-13 20:34:02 · 277 阅读 · 0 评论 -
文章标题 POJ 2523 : Colored Sticks(字典树+并查集+欧拉路径)
Colored SticksDescription You are given a bunch of wooden sticks. Each endpoint of each stick is colored with some color. Is it possible to align the sticks in a straight line such that the colors of原创 2016-11-13 21:01:23 · 415 阅读 · 0 评论 -
文章标题 POJ 2503 : Babelfish(字典树)
BabelfishDescription You 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原创 2016-11-13 21:37:19 · 473 阅读 · 0 评论 -
文章标题 POJ 2485 : Highways(最小生成树--kruskal+并查集)
HighwaysDescription The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public highways. So the traffic is difficult in Flatopia. The Flatopian government is aware of this原创 2016-11-13 21:53:22 · 369 阅读 · 0 评论 -
文章标题 POJ 1258 : Agri-Net(最小生成树--kruskal)
Agri-NetDescription Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He needs your help, of course. Farmer Jo原创 2016-11-13 22:07:01 · 284 阅读 · 0 评论 -
文章标题 POJ 2253 : Frogger(最短路--Floyd)
FroggerDescription Freddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but since the water is dirty and fu原创 2016-11-13 22:20:28 · 340 阅读 · 0 评论 -
文章标题 POJ 1860 : Currency Exchange(最短路--spfa)
Currency ExchangeDescription Several currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies and performs exchange operations only wit原创 2016-11-13 22:49:34 · 308 阅读 · 0 评论 -
文章标题 coderforces 755C : PolandBall and Forest(并查集)
PolandBall and ForestPolandBall lives in a forest with his family. There are some trees in the forest. Trees are undirected acyclic graphs with k vertices and k - 1 edges, where k is some integer. Note原创 2017-01-16 13:29:30 · 491 阅读 · 0 评论 -
文章标题 coderforces 339D : Xenia and Bit Operations (线段树+点修改)
Xenia and Bit OperationsXenia the beginner programmer has a sequence a, consisting of 2n non-negative integers: a1, a2, …, a2n. Xenia is currently studying bit operations. To better understand how they原创 2017-02-18 20:15:54 · 431 阅读 · 0 评论 -
文章标题 UVALive 4670 : Dominating Patterns (AC自动机模板题)
Dominating PatternsThe archaeologists are going to decipher a very mysterious “language”. Now, they know many language patterns; each pattern can be treated as a string on English letters (only lower c原创 2017-02-18 20:34:46 · 441 阅读 · 0 评论 -
文章标题 UVA 12299 : RMQ with Shifts(线段树+点修改)
RMQ with ShiftsIn the traditional RMQ (Range Minimum Query) problem, we have a static array A. Then for each query (L, R) (L<=R), we report the minimum value among A[L], A[L+1], …, A[R]. Note that the原创 2017-03-01 22:37:12 · 325 阅读 · 0 评论 -
文章标题 POJ 3268 : Silver Cow Party (最短路--spfa)
Silver Cow PartyOne cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party to be held at farm #X (1 ≤ X ≤ N). A total of M (1 ≤ M ≤ 100,000) unidirectio原创 2017-01-23 17:19:00 · 279 阅读 · 0 评论 -
文章标题 POJ 1151 : Atlantis (线段树+扫描线)
AtlantisThere are several ancient Greek texts that contain descriptions of the fabled island Atlantis. Some of these texts even include maps of parts of the island. But unfortunately, these maps descri原创 2017-03-01 22:56:42 · 261 阅读 · 0 评论 -
文章标题 Coderforces 343D : Water Tree(dfs序+线段树)
Water Tree题意:有n个点的树,1为根,然后有三种操作 (1)将节点u及其子树的所有节点变为1 (2)将节点u变为0 (3)查询节点u及其子树的所有节点是否为1 分析:首先可以将树形结构变为线性结构,即用DFS序将节点u及其控制的子树节点变成区间[ in[u] , out[u] ],然后对于(2)操作,就是线段树的单点修改;对于(1)操作,由于当节点u原来为0,其所有的祖先节点都为0原创 2017-10-17 00:16:49 · 322 阅读 · 0 评论