数据结构实验之图论十一：AOE网上的关键路径

最新推荐文章于 2018-12-04 21:59:00 发布

WaiR7

最新推荐文章于 2018-12-04 21:59:00 发布

阅读量395

点赞数 1

本文链接：https://blog.csdn.net/Bw9839/article/details/84722214

版权

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
using namespace std;
struct node
{
    int a,b,w;
}s[50010];
int dis[50010];
int path[50010];
int in[50010];
int out[50010];
int ans;
void Bellman(int n,int m)
{
    memset(path,0,sizeof(path));
    memset(dis,0,sizeof(dis));
    for(int j = 2; j <= n; j++)
    {
        bool flag = false;
        for(int i = 1;i<=m;i++)
        {
            if((dis[s[i].a] < dis[s[i].b] + s[i].w) || ((dis[s[i].a] == dis[s[i].b]+s[i].w)&& s[i].b < path[s[i].a]))
            {
                dis[s[i].a] = dis[s[i].b]+s[i].w;
                path[s[i].a] = s[i].b;
                flag = true;
            }
        }
        if(!flag)break;
    }
    printf("%d\n",dis[ans]);
    int k = ans;
    while(path[k]!=0)
    {
        printf("%d %d\n",k,path[k]);
        k = path[k];
    }

}
int main()
{
    int n,m;
    int i;
    while(~scanf("%d %d", &n,&m))
    {

        memset(s,0,sizeof(s));
        memset(in,0,sizeof(in));
        memset(out,0,sizeof(out));
        for(i = 1;i <= m; i++)
        {
            scanf("%d %d %d", &s[i].a,&s[i].b,&s[i].w);
            in[s[i].b]++;
            out[s[i].a]++;
        }
        for(i = 1;i <= n; i++)
        {
            if(in[i] == 0)
                ans = i;
        }
        Bellman(n,m);
    }
    return 0;
}


/***************************************************
User name: rj170408宋博文
Result: Accepted
Take time: 732ms
Take Memory: 1564KB
Submit time: 2018-07-26 16:32:20
****************************************************/