acwing341. 最优贸易

acwing1127. 香甜的黄油

leetcode743. 网络延迟时间

class Solution {public: int networkDelayTime(vector<vector<int>>& times, int n, int k) { int inf=INT_MAX/2; vector&lt

acwing852. spfa判断负环

#include<iostream>#include<cstring>#include<queue>using namespace std;const int N=1e5+10;int ne[N],e[N],h[N],idx,w[N];int n,m,dist[N

acwing851. spfa求最短路

#include<iostream>#include<cstring>#include<queue>using namespace std;const int N=1e5+10;int ne[N],e[N],h[N],idx,w[N];int n,m,dist[N