acwing383. 观光

暂无摘要...

acwing1137. 选择最佳线路

暂无摘要...

acwing903. 昂贵的聘礼

暂无摘要...

acwing1126. 最小花费

暂无摘要...

acwing1129. 热浪

暂无摘要...

leetcode1514. 概率最大的路径

class Solution {public: double maxProbability(int n, vector<vector<int>>& edges, vector<double>& succProb, int start, int

leetcode1334. 阈值距离内邻居最少的城市

暂无摘要...

leetcode743. 网络延迟时间

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

Dijkstra求最短路径

Dijkstra求最短路径原题链接代码#include<iostream>#include<cstring>using namespace std;const int N=510,M=1e5+10,INF=0x3f3f3f3f;int n,m,g[N][N],dist[N];