Kiritow/OJ-Problems-Source
1
0
Fork 0
mirror of https://github.com/Kiritow/OJ-Problems-Source.git synced 2024-03-22 13:11:29 +08:00
Code Issues Projects Releases Wiki Activity

Update 3562_unfinished.cpp

Browse Source
This commit is contained in:
Kirigaya Kazuto 2016-10-12 10:23:41 +08:00 committed by GitHub
parent 4b9de74b62
commit 48f7c99fc6
1 changed files with 8 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
SDUTOJ/3562_unfinished.cpp
View File

@ -27,13 +27,13 @@ int pre[1005];
void spfa(int s)
{
int i,j,now;
for(i=0; i<=n+1; i++)
for(i=0;i<=n+1;i++)
{
d[i]=MAX;
used[i]=false;
}
int flag=0;
for(i=0; i<=n+1; i++)
for(i=0;i<=n+1;i++)
{
if(cost[0][i]<MAX)pre[i]=i;//初始化pre数组
}
@ -45,7 +45,7 @@ void spfa(int s)
{
now=q.front();
q.pop();
for(i=0; i<=n+1; i++)
for(i=0;i<=n+1;i++)
{
if(d[i]>d[now]+cost[now][i])
{
@ -70,18 +70,17 @@ int main()
int we;
scanf("%d",&we);
while(we--)
{
scanf("%d%d",&n,&m);
{scanf("%d%d",&n,&m);
if(!n&&!m) break;
for(i=0; i<=n+1; ++i)
for(i=0;i<=n+1;++i)
{
for(j=0; j<=i; j++)
for(j=0;j<=i;j++)
{
if(i==j) cost[i][j]=0;
else cost[i][j]=cost[j][i]=MAX;
}
}
for(i=0; i<m; i++)
for(i=0;i<m;i++)
{
scanf("%d%d%d",&a,&b,&c);
cost[a][b]=c;