Irimsky

An ascending sorted sequence of distinct values is one in which some form of a less-than operator is used to order the elements from smallest to largest. For example, the sorted sequence A, B, C, D im...

介绍模板题：POJ-2449#include<iostream>#include<cstdio>#include<cstring>#include<queue>#include<algorithm>#define maxm 2000000#define maxn 10000using namespace std;st...

传送门：https://nanti.jisuanke.com/t/41349DescriptionThis is an era of team success, but also an era of heroes. Throughout the ages, there have been numerous examples of using the few to defeat the many...

存图方式主要有：邻接矩阵（m[i][j]m[i][j]m[i][j]为w（w!=0），表示i点到j点有一条w权值的路）、邻接表（m[u][i]m[u][i]m[u][i]记录的值为v、w,表示u到v点有一个w权值的路）用邻接矩阵非常浪费空间，有一种效率高且省空间的存图方法叫链式前向星。前向星前向星就是一种邻接表。它是一个边集数组，先将起点按从小到大顺序排列，如果相同则按终点从小到大排序，并记...