Curtis’Blog

1、ve数组的求解ve：顶点（事件）的最早开始时间（时刻）。//拓扑序列 stack<int> topOrder;//拓扑排序，顺便求ve数组 bool topologicalSort(){ queue<int> q; for(int i=0;i<n;i++) //遍历所有点，将入度为0的点加入队列 { if(inDegree[...

注意：1、队列的使用。//拓扑排序vector<int> G[maxv];int n,m,inDegree[maxv];bool topologicalSort(){ int num=0; queue<int> q; for(int i=0;i<n;i++) //将所有入度为0的点入队 { if(inDegree[i]==0)...

注意：1、并查集的巧妙应用。一、大致框架1、边的数据结构定义struct edge{ int u; //u、v: 边的两个端点 int v; int cost;}E[maxe];2、比较函数bool cmp(edge a,edge b){ return a.cost<b.cost;}3、kruskal函数int father[...

const int maxv=1000;const int inf=1000000000;1、邻接矩阵版primint G[maxv][maxv];int n;int d[maxv];bool vis[maxv]={false};int prim(){ fill(d,d+maxv,inf); d[0]=0; int ans=0; for(int i=0;...

弗洛伊德算法全源最短路径#include<cstdio>#include<algorithm>using namespace std;const int inf=1000000000;const int maxv=200;int n,m;int dis[maxv][maxv];void Floyd(){ for(int k=0;k<n...

vector<Node> adj[maxv];int n,d[maxv],num[maxv];bool inq[maxv];bool SPFA(int s){ memset(inq,false,sizeof(inq)); memset(num,0,sizeof(num)); fill(d,d+maxv,inf); queue<int> q; q.p...

题目：https://pintia.cn/problem-sets/994805342720868352/problems/994805523835109376#include<cstdio>#include<cstring>#include<vector>#include<set>#include<algorithm&...

struct Node{ int v; int dis;};vector<Node> adj[maxv]; //图的邻接表 int n; //n为顶点数 int d[maxv]; //从起点到各点的最短路径长度 bool Bellman(int s){ fill(d,d+maxv,inf); d[s]=0; //求数组d for(int ...

题目：https://pintia.cn/problem-sets/994805342720868352/problems/994805464397627392https://www.nowcoder.com/pat/1/submission-detail/64261014一、问题描述A traveler's map gives the distances between c...

1、使用Dijkstra算法记录所有的最短路径vector<int> pre[maxv];void Dijkstra(int s) { fill(d,d+maxv,inf); d[s]=0; for(int i=0;i<n;i++) { int u=-1; int min=inf; for(int j=0;j<n;j++) { if(...

题目：https://pintia.cn/problem-sets/994805342720868352/problems/994805523835109376一、问题描述As an emergency rescue team leader of a city, you are given a special map of your country. The map shows ...

const int maxv=1000;const int inf=1000000000;1、全局变量int G[maxv][maxv];int n;int d[maxv]; //起点到各点的最短路径长度 bool vis[maxv]={false};int pre[maxv];2、Dijkstra实现void Dijkstra(int s) { fill(d...

const int maxv=1000;const int inf=1000000000;1、邻接矩阵版Dijkstraconst int maxv=1000;const int inf=1000000000;//1、邻接矩阵版Dijkstraint G[maxv][maxv];int n;int d[maxv]; //起点到各点的最短路径长度 bool vis[m...

一、问题描述1076Forwards on Weibo(30分)Weibo is known as the Chinese version of Twitter. One user on Weibo may have many followers, and may follow many other users as well. Hence a social network is fo...

1、邻接矩阵版BFSint n; int G[maxv][maxv];bool inq[maxv]={false};void BFS(int u){ queue<int>q; q.push(u); inq[u]=true; while(!q.empty()) { int u=q.front(); q.pop(); for(int v=0;v&...