2014年1月15日
hdu 1233 还是畅通工程（最小生成树，基础）
题目//也是标准的最小生成树啊，我就改一点点，不重新再打一遍增加熟练度了#define _CRT_SECURE_NO_WARNINGS#include#include#includeusing namespace std;#define M 110#define inf 999999999int mat[M][M];int prim(int n,int sta){ int i,j,sum=0,mark[M],dis[M]; for(i=0;imat[flag][j]) dis[j]=mat[flag][j]; } } ret... Read More
posted @ 2014-01-15 21:30 laiba2004 Views(121) Comments(0) Diggs(0)
hdu 1879 继续畅通工程（最小生成树，基础）
题目#define _CRT_SECURE_NO_WARNINGS#include#include#includeusing namespace std;#define M 110#define inf 999999999int mat[M][M];int prim(int n,int sta){ int i,j,sum=0,mark[M],dis[M]; for(i=0;imat[flag][j]) dis[j]=mat[flag][j]; } } return sum;}int main(){ int i,n,m,... Read More
posted @ 2014-01-15 21:21 laiba2004 Views(113) Comments(0) Diggs(0)
hdu 1863 畅通工程（最小生成树，基础）
题目#define _CRT_SECURE_NO_WARNINGS#include #include#include #include#include#include#includeusing namespace std;#define M 110#define inf 999999999int mat[M][M];int prim(int n,int sta){ int i,j,dis[M],mark[M],sum=0; for(i=0;imat[flag][j]) dis[j]=mat[flag][j]; } ... Read More
posted @ 2014-01-15 20:58 laiba2004 Views(103) Comments(0) Diggs(0)
HDU 1102 Constructing Roads(最小生成树，基础题)
注意标号要减一才为下标，还有已建设的路长可置为0题目#define _CRT_SECURE_NO_WARNINGS#include #include#include #include#include#includeusing namespace std;#define M 110#define inf 999999999int mat[M][M];int prim(int n,int sta){ int mark[M],dis[M]; int i,sum=0,j,flag; for(i=0;imat[flag][j]) dis[j]=mat[f... Read More
posted @ 2014-01-15 16:03 laiba2004 Views(139) Comments(0) Diggs(0)
hdu 1162 Eddy's picture（最小生成树，基础）
题目#define _CRT_SECURE_NO_WARNINGS#include #include#include #include#include#include#includeusing namespace std;#define M 110#define inf 999999999double mat[M][M];struct tt{ double x,y;}dian[M];double prim(int n,int sta){ double minn,sum=0,dis[M]; int mark[M],i,j,flag; for(i=0;imat[flag]... Read More
posted @ 2014-01-15 16:01 laiba2004 Views(127) Comments(0) Diggs(0)
HDU 1301 Jungle Roads （最小生成树，基础题，模版解释）——同 poj 1251 Jungle Roads
双向边，基础题，最小生成树题目同题目#define _CRT_SECURE_NO_WARNINGS#include #include#include #include#include#includeusing namespace std;#define inf 999999999#define M 110int mat[M][M];int prim(int n,int sta){ int mark[M],dis[M]; int i,sum=0,j; for(i=0;imat[flag][j]) dis[j]=mat[flag][j]; ... Read More
posted @ 2014-01-15 16:00 laiba2004 Views(245) Comments(0) Diggs(0)