自定义博客皮肤VIP专享

*博客头图:

格式为PNG、JPG,宽度*高度大于1920*100像素,不超过2MB,主视觉建议放在右侧,请参照线上博客头图

请上传大于1920*100像素的图片!

博客底图:

图片格式为PNG、JPG,不超过1MB,可上下左右平铺至整个背景

栏目图:

图片格式为PNG、JPG,图片宽度*高度为300*38像素,不超过0.5MB

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+
  • 博客(10)
  • 收藏
  • 关注

原创 C++数据结构之栈的实现(顺序栈)

C++数据结构之栈的实现(顺序栈)首先我们定义了一个栈模板类,它有几个纯虚函数,分别是栈类最常用的几个函数Push() 将元素放入栈顶Top() 返回栈顶元素值Pop() 弹出栈顶元素Clear() 清空栈(析构函数会用到)同样我们定义了判断栈是否为空函数IsEmpty(),以及保护成员—栈的高度(长度)height;模板类定义代码如下template<class typ...

2020-04-16 19:46:04 783

原创 Dijkstra算法

Dijkstra 算法是对SPFA算法的优化,将普通的队列改为关于距离的优先队列。好处是一旦某个元素出列,这个元素的最短距离已经正确,无需再次入列。算法描述:不再将相邻点编号加入队列,而是将相邻点的编号和距离都加入队列,每次出列距离最小的点模板:#include <bits/stdc++.h>using namespace std;typedef pair<int, ...

2020-02-21 11:43:15 134

原创 SPFA算法实现

SPFA算法是基于拓扑排序的升级版,将边权也考虑在内,SPFA实质是一种基于距离更新+队列的算法。算法描述:基于拓扑排序稍作改动。从给定起点开始,周围点若距离有更新(变长或变短),就更新距离,若被更新点不在队列里,就把被更新点入列;代码实现#include <bits/stdc++.h>using namespace std;typedef long long ll;t...

2020-02-21 10:55:43 325

原创 拓扑排序

拓扑排序是查找有向无环图(DAG)的拓扑序或最长(短)路的一种基本方法,依据BFS思想。一般模板如下:#include<bits/stdc++.h>using namespace std;int T,n,m,u,v;int deg[100005]; //deg[i]表示i的入度 int vis[100005]; //思考一下,没有vis数组会出现什么问题? vector&...

2020-02-21 09:59:56 123

原创 Weakness and Poorness

Weakness and PoornessYou are given a sequence of n integers a1, a2, …, an.Determine a real number x such that the weakness of the sequence a1 - x, a2 - x, …, an - x is as small as possible.The weak...

2020-02-18 12:40:25 186

原创 E - Aggressive cows

二分法

2020-02-18 12:16:04 124

原创 Multiplication Table

Multiplication TableBizon the Champion isn’t just charming, he also is very smart.While some of us were learning the multiplication table, Bizon the Champion had fun in his own manner. Bizon the Cha...

2020-02-18 10:03:07 207

原创 Error Curves

Error CurvesJosephina is a clever girl and addicted to Machine Learning recently. Shepays much attention to a method called Linear Discriminant Analysis, whichhas many interesting properties.In or...

2020-02-18 09:47:05 428

原创 Expanding Rods

Expanding RodsWhen a thin rod of length L is heated n degrees, it expands to a new length L’=(1+n*C)*L, where C is the coefficient of heat expansion.When a thin rod is mounted on two solid walls and...

2020-02-18 09:26:11 98

转载 D - Sand Fortress

D - Sand FortressYou are going to the beach with the idea to build the greatest sand castle ever in your head! The beach is not as three-dimensional as you could have imagined, it can be decribed as ...

2020-02-18 00:24:15 244

空空如也

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人

提示
确定要删除当前文章?
取消 删除