风骨散人 - 博客园

摘要： You're given a permutation aa of length nn (1 \le n \le 10^51≤n≤105).For each i \in [1,n]i∈[1,n], construc... 阅读全文

posted @ 2019-09-02 19:22 风骨散人阅读(88) 评论(0) 推荐(0)

摘要： As the current heir of a wizarding family with a long history,unfortunately, you find yourself forced to p... 阅读全文

posted @ 2019-09-02 19:12 风骨散人阅读(104) 评论(0) 推荐(0)

摘要：在图论中，拓扑排序（Topological Sorting）是一个有向无环图（DAG, Directed Acyclic Graph）的所有顶点的线性序列。且该序列必须满足下面两个条件：每个顶点出现且只出现一次。... 阅读全文

posted @ 2019-08-31 00:05 风骨散人阅读(324) 评论(0) 推荐(0)

摘要： E. Dima and HorsesDima came to the horse land. There are n horses living in the land. Each horse in the ho... 阅读全文

posted @ 2019-08-30 09:40 风骨散人阅读(212) 评论(0) 推荐(0)

摘要： B. Dima and SequenceDima got into number sequences. Now he's got sequence a1, a2, ..., an, consisting of n... 阅读全文

posted @ 2019-08-30 09:35 风骨散人阅读(182) 评论(0) 推荐(0)

摘要： Emuskald is an avid horticulturist and owns the world's longest greenhouse — it is effectively infinite in... 阅读全文

posted @ 2019-08-30 09:32 风骨散人阅读(243) 评论(0) 推荐(0)

摘要： C. Magical BoxesEmuskald is a well-known illusionist. One of his trademark tricks involves a set of magica... 阅读全文

posted @ 2019-08-30 09:25 风骨散人阅读(136) 评论(0) 推荐(0)

摘要： B. MultithreadingEmuskald is addicted to Codeforces, and keeps refreshing the main page not to miss any ch... 阅读全文

posted @ 2019-08-30 09:20 风骨散人阅读(176) 评论(0) 推荐(0)

摘要： Key word：①BFS转换Dijkstra②其他关系转化为最短路③反向建边及反向Dijkstra④稠密图、稀疏图⑤链式前向星⑥Vector建图⑦超级源点&汇点详解：1.BFS转换Dijkstra：对于一些路... 阅读全文

posted @ 2019-08-29 17:16 风骨散人阅读(316) 评论(0) 推荐(0)

摘要：背景：给出题目，在一张图中有多个点起点，一个终点，求所有起点到终点的最短距离。解题方法：1.跑N边单源最短路，但是这样是不行的肯定超时。2.floyd求出所有最短路，枚举每个起点到终点的距离，这个似乎比法1更慢。... 阅读全文

posted @ 2019-08-29 15:24 风骨散人阅读(877) 评论(0) 推荐(1)

CM_Lunatic