
学校oj
Xmas190
这个作者很懒,什么都没留下…
展开
-
ola26729784最小生成树2020.12.01
#include<stdio.h> #define MAX_VERTEX_NUM 50//椤剁偣涓暟 #define INF 100000000 int U[MAX_VERTEX_NUM] = {1,1,1,2,2,2,3,3,4,4,5,5,5,6,6,6,7,8,9}; int V[MAX_VERTEX_NUM] = {2,4,5,3,5,6,6,7,5,8,6,8,9,7,9,10,10,9,10}; int C[MAX_VERTEX_NUM] = {3,4,4,10,2,3,6,1,原创 2020-12-01 09:11:30 · 147 阅读 · 0 评论 -
ola2672978400 oj最短路径
#include<stdio.h> #define MAX_VERTEX_NUM 50//顶点个数 #define INF 100000000 int U[MAX_VERTEX_NUM] = {1,1,2,2,3,3,4,4,4,4,5,7}; int V[MAX_VERTEX_NUM] = {2,4,4,5,1,6,3,5,6,7,7,6}; int C[MAX_VERTEX_NUM] = {2,1,3,10,4,5,2,2,8,4,6,1}; int adj[MAX_VERTEX_NUM]原创 2020-11-23 19:54:44 · 167 阅读 · 0 评论