![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
最短路径问题
123~mutouren
这个作者很懒,什么都没留下…
展开
-
hdu 2066 一个人的旅行
#include<bits/stdc++.h> using namespace std; #define INF 0x3f3f3f3f #define MAXN 1002 int T,S,D; int Map[MAXN][MAXN]; void InitMap(){ for(int i = 0; i <= 1000; i++){ Map[i][i] = 0; for(int j = i+1; j <= 1000; j++)原创 2021-07-23 10:16:03 · 63 阅读 · 0 评论 -
hdu 2680 Choose the best route
#include<stdio.h> #include<string.h> #define N 0x3f3f3f #define M 1010 int Map[M][M],vis[M],dis[M],m,n,Min; int min(int a,int b) { return a>b?b:a; } void dj(int v) { int k,i,j; memset(vis,0,sizeof(vis)); for(i=1;i<=m;i++) dis[i]=Map[原创 2021-07-14 19:39:11 · 59 阅读 · 0 评论 -
hdu 1874 畅通工程续
#include<bits/stdc++.h> using namespace std; #define M 205 #define inf 0x7fffffff int Map[M][M], vis[M], dis[M]; int main(){ int n, m, a, b, d, s, t, next, Min; while(scanf("%d %d", &n, &m) == 2) { for(int i = 0; i < M; i+原创 2021-07-13 20:37:14 · 83 阅读 · 0 评论