BacktoWin

Truck History Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 18812   Accepted: 7257 Description Advanced Cargo Movement, Ltd. uses trucks of different types

拓扑排序水题，这题

/* Kahn 算法 复杂度：O(E+V) L← Empty list that will contain the sorted elements S ← Set of all nodes with no incoming edges while S is non-empty do remove a node n from S insert n into L for eac

#include #include #include #include using namespace std; #define INF 10000000 int n,m; int a[105][105]; void warashall_floyd(){ for(int k=0;k<n;k++){ for(int i=0;i<n;i++){ for(int j=0;j<n;j+

这题给的内存忒小了，不能用邻接矩阵存，只能用邻接表

拓扑排序，直接pan

裸的最小生成树 #include #include #include #include using namespace std; const int INF=0x3f3f3f3f; const int maxn=30; bool vis[maxn]; int lowc[maxn]; int cost[maxn][maxn]; int n; int prim(){ int ans=0;