|
|
|
|
|
摘要:
#include int m,n;//n个城市 m条道路 struct node{ int a,b,c,p,r; }; int visit[11]={0}; int min=100000; node point[11]; void dfs(int k,int cost) { if(cost>=min) { return; } if(poin... 阅读全文
posted @ 2017-02-07 17:19
dahua1
阅读(104)
推荐(0)
编辑
摘要:
#include int map[5][5]={0,1,0,0,0, 0,1,0,1,0, 0,0,0,0,0, 0,1,1,1,0, 0,0,0,1,0}; int mx[4]={0,0,1,-1}; int my[4]={1,-1,0,0}; int q; typedef struct node { int x; int y; int s... 阅读全文
posted @ 2017-01-11 09:12
dahua1
阅读(101)
推荐(0)
编辑
摘要:
#include int map[4][4]={0,0,0,1, 0,0,1,1, 0,0,1,0, 0,1,0,0}; int mx[4]={0,0,1,-1}; int my[4]={1,-1,0,0}; typedef struct node { int x; int y;}node; node dui[1000]; int tou=0;... 阅读全文
posted @ 2017-01-10 17:01
dahua1
阅读(103)
推荐(0)
编辑
摘要:
#include char data[100][100]; int map[100][100]; int h,l; int dx[8]={0,1,1,1,0,-1,-1,-1}; int dy[8]={1,1,0,-1,-1,-1,0,1}; int max=0; typedef struct node { int x; int y; }node; void fun(int x... 阅读全文
posted @ 2017-01-10 16:49
dahua1
阅读(141)
推荐(0)
编辑
摘要:
#include int data[8][5]={0}; int b[8][5]={0}; int m,n; int dy[3]={0,-1,1}; int k=0; int mon; int max; void dfs(int x,int y,int step) { if(step==n) { //printf("%d",mon); if(max=0&&nx=0&&ny=... 阅读全文
posted @ 2017-01-10 11:10
dahua1
阅读(109)
推荐(0)
编辑
摘要:
#include int m,n; int *p; int dis=0; int peo=0; int data[3][2]; int b[3][2]; int da[3][2]; int dx[2]={-1,1}; int a[6][3]={{0,1,2},{0,2,1},{1,2,0},{1,0,2},{2,0,1},{2,1,0}}; int l=1; int r=1; int q; i... 阅读全文
posted @ 2017-01-09 09:19
dahua1
阅读(170)
推荐(0)
编辑
摘要:
#include int m, n; //m为测试案例 int sx, sy, ex, ey; int data[5][5] = { 0 }; int vis[5] = { 0 }; int min; int d(int a, int s, int d, int f) { int he1 = a - d> 0 ? a - d : d - a; int he2 = s - f > 0 ? s ... 阅读全文
posted @ 2017-01-08 20:09
dahua1
阅读(135)
推荐(0)
编辑
摘要:
#include int m,n; typedef struct node { int upx,upy; int dox,doy; int c; }node; node point[20]; int visit[20]; int map[20][20]; int indegree[20]; int min=1000; void handle() //建立有向图 { for(... 阅读全文
posted @ 2017-01-05 16:42
dahua1
阅读(79)
推荐(0)
编辑
摘要:
#include char data[16]; int a[16]; int d[4] = { -4, 1, 4, -1 }; char b[16]; int flag; int count = 0; int min = 1000; int sum; void dfs(int step) { sum = 0; for (int i = 0; i = min) return; if... 阅读全文
posted @ 2017-01-04 23:44
dahua1
阅读(82)
推荐(0)
编辑
摘要:
#include char data[16]; int a[16]; int d[5]={0,-4,1,4,-1}; char b[16]; int flag; int count; int min=1000; void dfs(int step) { if(step==16) { for(int i=0;imin) return; ... 阅读全文
posted @ 2017-01-04 16:58
dahua1
阅读(64)
推荐(0)
编辑
|
|