lingxiao的博客

动态规划题，从下往上较大的相加：#include<stdio.h> int max(int i,int j) { if(i>j) return i; else return j; } int main() { int n; int a[100][100]; int msum[100][100];//保存在msum中 wh

逐行进行广度优先遍历，代码如下：//elingxiao #include <iostream> #include <cstdio> #include <cstring> using namespace std; int n,k; int vis[10]; int ans=0; char map[10][10]; void dfs(int cur,int num)//将第k-num颗棋子放在cur行上

prim算法要点见注释#include<iostream> #include<cstring> #include<cstdio> #include<cstdlib> #include<algorithm> using namespace std; #define maxn 100 #define inf 0xfffffffint N; //总点数 int d[maxn][maxn];//图

prim算法模板+判断连通性，构造出二维数组是关键：#include<iostream> #include<cstdio> #include<cstdlib> #include<cmath> #include<cstring> #define inf 0x7f7f7f7f #define maxn 101 using namespace std; double d[maxn][maxn]; doub

prim算法稍加变化，看代码：#include<iostream> #include<cstring> #include<cstdio> #include<cstdlib> #include<algorithm> using namespace std; #define maxn 1001 #define inf 0xfffffffint n; //总点数 int d[maxn][maxn

prim算法#include #include #include #include using namespace std; #define maxn 110 #define inf 0x7f7f7f7f int n; int d[maxn][maxn];//图 int l[maxn];//未选点到已选点的距离 int

prim算法#include<iostream> #include<cstring> #include<cstdio> #include<cstdlib> #include<algorithm> using namespace std; #define maxn 30 #define inf 0xfffffffint n; //总点数 int d[maxn][maxn];//村庄图 int