随笔分类 -  数据结构

Educational Codeforces Round 3 E. Minimum spanning tree for each edge LCA/(树链剖分+数据结构) + MST
摘要：E. Minimum spanning tree for each edge E. Minimum spanning tree for each edge Connected undirected weighted graph without self-loops and multiple edge 阅读全文
posted @ 2016-08-12 15:41 meekyan 阅读(183) 评论(0) 推荐(0)
HDU 1540 Tunnel Warfare 平衡树 / 线段树：单点更新，区间合并
摘要：Tunnel Warfare Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Problem Description During the War of Resistance Again 阅读全文
posted @ 2016-07-16 17:37 meekyan 阅读(249) 评论(0) 推荐(0)
Codeforces Round #340 (Div. 2)E. XOR and Favorite Number 莫队算法
摘要：E. XOR and Favorite Number Bob has a favorite number k and ai of length n. Now he asks you to answer m queries. Each query is given by a pair li and r 阅读全文
posted @ 2016-02-29 16:54 meekyan 阅读(185) 评论(0) 推荐(1)
143 - ZOJ Monthly, October 2015 I Prime Query 线段树
摘要：Prime QueryTime Limit:1 Second Memory Limit:196608 KBYou are given a simple task. Given a sequenceA[i]withNnumbers. You have to perform Q operations o... 阅读全文
posted @ 2015-10-11 18:39 meekyan 阅读(185) 评论(0) 推荐(0)
HDU5441 Travel 离线并查集
摘要：TravelProblem DescriptionJack likes to travel around the world, but he doesn’t like to wait. Now, he is traveling in the Undir... 阅读全文
posted @ 2015-10-11 18:31 meekyan 阅读(195) 评论(0) 推荐(0)
CDOJ 383 Japan 树状数组
摘要：JapanJapan plans to welcome the ACM ICPC World Finals and a lot of roads must be built for the venue. Japan is tall island w... 阅读全文
posted @ 2015-10-10 19:50 meekyan 阅读(353) 评论(0) 推荐(0)
ZOJ3659 Conquer a New Region 并查集
摘要：Conquer a New RegionTime Limit:5 Seconds Memory Limit:32768 KBThe wheel of the history rolling forward, our king conquered a new region in a distant c... 阅读全文
posted @ 2015-09-16 22:19 meekyan 阅读(202) 评论(0) 推荐(0)
BZOJ1202 [HNOI2005]狡猾的商人 并查集维护前缀和
摘要：1202: [HNOI2005]狡猾的商人Time Limit:10 SecMemory Limit:162 MBSubmit:1935Solved:936[Submit][Status][Discuss]Description刁姹接到一个任务，为税务部门调查一位商人的账本，看看账本是不是伪造的。账... 阅读全文
posted @ 2015-09-13 23:57 meekyan 阅读(200) 评论(0) 推荐(1)
HDU4267 树状数组 不连续区间修改(三维)
摘要：A Simple Problem with Integers Problem Description Let A1, A2, ... , AN be N elements. You need to deal with two kinds of operations. One type of oper 阅读全文
posted @ 2015-09-09 00:00 meekyan 阅读(251) 评论(0) 推荐(0)
HDU 3308 线段树单点更新+区间查找最长连续子序列
摘要：LCIS Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 65536/3... 阅读全文
posted @ 2015-09-08 01:06 meekyan 阅读(415) 评论(3) 推荐(0)
【rqnoj28】[Stupid]愚蠢的宠物
摘要：题目描述背景大家都知道，sheep有两只可爱的宠物（一只叫神牛，一只叫神菜）。有一天，sheep带着两只宠物到狗狗家时，这两只可爱的宠物竟然迷路了……描述狗狗的家因为常常遭到猫猫的攻击，所以不得不把家里前院的路修得非常复杂。狗狗家前院有N个连通的分叉结点，且只有N-1条路连接这N个节点，节点的编号是... 阅读全文
posted @ 2015-07-17 20:44 meekyan 阅读(201) 评论(0) 推荐(0)
【rqnoj378】 约会计划
摘要：题目描述cc是个超级帅哥，口才又好，rp极高（这句话似乎降rp），又非常的幽默，所以很多mm都跟他关系不错。然而，最关键的是，cc能够很好的调解各各妹妹间的关系。mm之间的关系及其复杂，cc必须严格掌握她们之间的朋友关系，好一起约她们出去，cc要是和不是朋友的两个mm出去玩，后果不堪设想……cc只掌... 阅读全文
posted @ 2015-07-17 20:23 meekyan 阅读(240) 评论(0) 推荐(0)