摘要： Problem - 2066 入门SP，用dij+heap 0ms通过。View Code 1 #define REP(i, n) for (int i = 0; i < (n); i++) 2 #define REP_1(i, n) for (int i = 1; i <= (n); i++) 3 typedef pair<LL, int> PLI; 4 #define PB push_back 5 #define MPR make_pair 6 #define FI first 7 #define SE second 8 9 VPII rel[N];10 LL di 阅读全文