随笔分类 -  图论-拓扑排序

P1983 车站分级
摘要：题面:https://www.luogu.org/problem/P1983 cpp 首先我们来谈一谈邻接表+dfs: 假设有一辆车经过三个车站ai,aj,ak(ai,aj,ak车站编号递增) 那么在ai,aj之间的a(i+1),a(i+2),.......,a(j 1)的级别一定是严格小于ai和a 阅读全文
posted @ 2019-08-20 13:44 prestige 阅读(178) 评论(0) 推荐(0)
拓扑排序
摘要：```cpp include include include include include include include include using namespace std; const int N=105; int n,m,x,y,MAP[N][N],indegree[N]; void t 阅读全文
posted @ 2019-07-16 13:38 prestige 阅读(71) 评论(0) 推荐(0)