数据结构
文章平均质量分 94
一只小陀螺
这个作者很懒,什么都没留下…
展开
-
STL heap相关
STL中并没有把heap作为一种容器组件,heap的实现亦需要更低一层的容器组件(诸如list,array,vector)作为其底层机制。Heap是一个类属算法,包含在algorithm头文件中。虽然STL中关于heap默认调整成的是大顶堆,但却可以让用户利用自定义的compare_fuction函数实现大顶堆或小顶堆。heap的低层机制vector本身就是一个类模板,heap基于vector便实...转载 2018-05-01 23:53:21 · 115 阅读 · 0 评论 -
PTA 09-排序3 Insertion or Heap Sort(25 分)
题目:According to Wikipedia:Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insertion sort removes one element from the input data...原创 2018-05-02 17:03:27 · 1122 阅读 · 0 评论 -
PTA 09-排序2 Insert or Merge(25 分)
题目:According to Wikipedia:Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insertion sort removes one element from the input data...原创 2018-05-03 10:32:06 · 582 阅读 · 0 评论 -
ACM-ICPC 2018 南京赛区网络预赛 B-The writing on the wall
Feeling hungry, a cute hamster decides to order some take-away food (like fried chicken for only 3030 Yuan).However, his owner CXY thinks that take-away food is unhealthy and expensive. So she deman...原创 2018-09-02 13:39:59 · 641 阅读 · 5 评论 -
ACM-ICPC 2018 焦作赛区网络预赛 E - Jiu Yuan Wants to Eat
You ye Jiu yuan is the daughter of the Great GOD Emancipator. And when she becomes an adult, she will be queen of Tusikur, so she wanted to travel the world while she was still young. In a country, sh...原创 2018-09-16 11:14:02 · 247 阅读 · 0 评论 -
LCA 倍增算法
const int MAXN = 1e6 + 100;struct LCA { struct edge { int from, to, w, nxt; }edges[MAXN << 3]; int head[MAXN], cnt, n; int id[MAXN], dep[MAXN], dist[MAXN]; int fa[MAXN][32]; void ad...原创 2019-05-11 09:53:12 · 286 阅读 · 0 评论