摘要:
HDU 3038 How Many Answers Are Wrong 带权并查集:路径压缩真巧妙 #include"stdio.h" #include"string.h" #include"math.h" #include<algorithm> #include<vector> using nam 阅读全文
摘要:
POJ 2253 Frogger | POJ 1797 Heavy Transportation | POJ 3268 Silver Cow Party Dijkstra使用链式前向星实现的G=(V,E) https://malash.me/200910/linked-forward-star/#c 阅读全文
摘要:
POJ 3660 Cow Contest Floyd-Washall const int MAX_N = 103; const int INF = 0x3fffffff; int N,M; int W[MAX_N][MAX_N]; int D[MAX_N][MAX_N]; int tmpD[MAX_ 阅读全文
摘要:
POJ 1860 Currency Exchange | POJ 3259 Wormholes | LightOJ 1074 Extended Traffic SPFA (Bellman Ford) POJ 1860 Currency Exchange #include"stdio.h" #incl 阅读全文