C++博客-infinity-最新评论http://www.cppblog.com/infinity/CommentsRSS.aspxzh-cnMon, 14 Aug 2017 06:47:40 GMTMon, 14 Aug 2017 06:47:40 GMTcnblogsre: Bellman-Ford算法http://www.cppblog.com/infinity/archive/2014/02/24/66621.html#205924ACalvinACalvinMon, 24 Feb 2014 12:33:00 GMThttp://www.cppblog.com/infinity/archive/2014/02/24/66621.html#205924个人理解：前面提到是至多只有s层的节点的最短距离，即已经搜索完全源点到它的所有路径，因此可以这么理解

ACalvin 2014-02-24 20:33 发表评论
]]>re: Bellman-Ford算法http://www.cppblog.com/infinity/archive/2013/08/26/66621.html#202783路过路过Mon, 26 Aug 2013 14:42:00 GMThttp://www.cppblog.com/infinity/archive/2013/08/26/66621.html#202783同求- -#

路过 2013-08-26 22:42 发表评论
]]>re: Bellman-Ford算法[未登录]http://www.cppblog.com/infinity/archive/2013/04/23/66621.html#199661可乐可乐Tue, 23 Apr 2013 08:27:00 GMThttp://www.cppblog.com/infinity/archive/2013/04/23/66621.html#199661

可乐 2013-04-23 16:27 发表评论
]]>re: poj 2312 Battle Cityhttp://www.cppblog.com/infinity/archive/2012/09/16/62331.html#190912ty78ty78Sun, 16 Sep 2012 14:31:00 GMThttp://www.cppblog.com/infinity/archive/2012/09/16/62331.html#190912我都把X,Y相关的替换？能说明下嘛，我是个菜鸟
#include<stdio.h>
typedef struct node
{
int x;
int y;
}node;
node Q[100000];
char board[301][301];
int step[301][301];
int m,n;
const int dx[]={0,0,-1,1},dy[]={-1,1,0,0};

int ok(int x,int y)
{
if(x>=0&&x<m&&y>=0&&y<n) return 1;
else return 0;
}

void solve(int x1,int y1,int x2,int y2)
{
int i,j,cntx,cnty,nextx,nexty,head,tail,tmp,minstep=0x7fffffff;
cntx=x1;cnty=y1;head=tail=0;
for(i=0;i<m;i++)
for(j=0;j<n;j++)
step[i][j]=0x7fffffff;
step[cnty][cntx]=0;

while(1)
{
for(i=0;i<4;i++)
{
nextx=cntx+dx[i];
nexty=cnty+dy[i];
if(ok(nextx,nexty))
{
if(board[nexty][nextx]=='E')
{
tmp=step[cnty][cntx]+1;
if(tmp<step[nexty][nextx])
{
step[nexty][nextx]=tmp;
Q[++tail].x=nextx;
Q[tail].y=nexty;
}
}
if(board[nexty][nextx]=='B')
{
tmp=step[cnty][cntx]+2;
if(tmp<step[nexty][nextx])
{
step[nexty][nextx]=tmp;
Q[++tail].x=nextx;
Q[tail].y=nexty;
}
}
if(board[nexty][nextx]=='T')
{
if(step[cnty][cntx]+1<minstep) minstep=step[cnty][cntx]+1;
}
}
}
if(head==tail) break;
else
{
cntx=Q[++head].x;
cnty=Q[head].y;
}

}
if(minstep==0x7fffffff) printf("-1\n");
else printf("%d\n",minstep);

}

int main()
{
while(1)
{
int i,j;
int x1,y1,x2,y2;

scanf("%d%d",&m,&n);
getchar();

if(m==0&&n==0) return 0;

for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
board[i][j]=getchar();
if(board[i][j]=='Y')
{
x1=j;y1=i;
}
if(board[i][j]=='T')
{
x2=i;y2=j;
}
}
getchar();
}
solve(x1,y1,x2,y2);
}
return 0;

}



ty78 2012-09-16 22:31 发表评论
]]>re: python写的短路计算软件http://www.cppblog.com/infinity/archive/2011/10/21/137975.html#158799vsweavervsweaverFri, 21 Oct 2011 01:32:00 GMThttp://www.cppblog.com/infinity/archive/2011/10/21/137975.html#158799

vsweaver 2011-10-21 09:32 发表评论
]]>