bettle_king的博客

https://www.acwing.com/problem/content/description/1131/ #include<cstdio> #include<iostream> #include<algorithm> #include<cstring> using namespace std; const int N=2510; int g[N][N]; int dist[N]; bool st[N]; int startx,endx; int n,.

https://www.acwing.com/problem/content/description/1194/ 拓扑排序： 反向建边。 #include<cstdio> #include<iostream> #include<algorithm> #include<queue> #include<vector> #include<cstring> using namespace std; const int N=1e4*2+10;.

https://www.acwing.com/problem/content/description/1193/ #include<cstdio> #include<iostream> #include<cstring> #include<algorithm> #include<queue> #include<vector> using namespace std; const int N=110; const int M=660; .

https://www.acwing.com/problem/content/description/1641/ #include<cstdio> #include<iostream> #include<algorithm> #include<cstring> #include<queue> using namespace std; const int N=1e3+10; const int M=1e4+10; int h[N],e[M],ne[.

https://ac.nowcoder.com/acm/contest/1013/A 正解是： 拓扑排序 自己太垃圾拓扑排序不是太熟练，只会暴力。 #include<cstdio> #include<iostream> #include<cstring> using namespace std; const int N=1e4*3+10; int h[N],e[N],ne[N],idx; bool st[N]; int n,m; void add(int a,int .