Poj 1734 Sightseeing trip floyd最小环

原创 2015年11月18日 21:21:23

Sightseeing trip
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 5698 Accepted: 2203 Special Judge
Description

There is a travel agency in Adelton town on Zanzibar island. It has decided to offer its clients, besides many other attractions, sightseeing the town. To earn as much as possible from this attraction, the agency has accepted a shrewd decision: it is necessary to find the shortest route which begins and ends at the same place. Your task is to write a program which finds such a route.

In the town there are N crossing points numbered from 1 to N and M two-way roads numbered from 1 to M. Two crossing points can be connected by multiple roads, but no road connects a crossing point with itself. Each sightseeing route is a sequence of road numbers y_1, …, y_k, k>2. The road y_i (1<=i<=k-1) connects crossing points x_i and x_{i+1}, the road y_k connects crossing points x_k and x_1. All the numbers x_1,…,x_k should be different.The length of the sightseeing route is the sum of the lengths of all roads on the sightseeing route, i.e. L(y_1)+L(y_2)+…+L(y_k) where L(y_i) is the length of the road y_i (1<=i<=k). Your program has to find such a sightseeing route, the length of which is minimal, or to specify that it is not possible,because there is no sightseeing route in the town.
Input

The first line of input contains two positive integers: the number of crossing points N<=100 and the number of roads M<=10000. Each of the next M lines describes one road. It contains 3 positive integers: the number of its first crossing point, the number of the second one, and the length of the road (a positive integer less than 500).
Output

There is only one line in output. It contains either a string ‘No solution.’ in case there isn’t any sightseeing route, or it contains the numbers of all crossing points on the shortest sightseeing route in the order how to pass them (i.e. the numbers x_1 to x_k from our definition of a sightseeing route), separated by single spaces. If there are multiple sightseeing routes of the minimal length, you can output any one of them.
Sample Input

5 7
1 4 1
1 3 300
3 1 10
1 2 16
2 3 100
2 5 15
5 3 20
Sample Output

1 3 5 2

题意:给n个点,m条双向边,找出最小环。
找出最小环可看成i->j的路径可由i->k->j->i这条更短的路径更新而来,可以推出一个路径长度表达式dis[i][j]+Map[i][k]+Map[k][j]。因为是最小环,不必考虑方向,即不考虑谁指向谁,只要是个环就行了(之前一直在这里纠结,真是无药可救),即可以采用floyd来跑找出最小环。因为floyd是个更新最短路的过程,更新过后环路径可能就不存在了,所以必须在更新前找出最小环,所以查找过程写在更新最短路之前。定义一个ans=inf,由如果ans>dis[i][j]+Map[i][k]+Map[k][j],则更新ans,如果不能更新就直接输出”No solution.”。能更新则用findpath()来储存路径。还有在更新最短路时,最短路径由i->j变为i->k->j,所以path[i][j]要更新为path[k][j]。

#include"stdio.h"
#include"iostream"
#include"algorithm"
#include"string.h"
#define maxn 510
#define inf 0xfffffff

using namespace std;

int n,m;
int num;
int dis[maxn][maxn];  ///i->j的最短路
int Map[maxn][maxn];  ///
int path[maxn][maxn];  ///用更新最短时储存路径和更新road用的
int road[maxn];  ///路径

void init()   ///初始化
{
    for(int i = 0;i < maxn;i++)
    {
        road[i] = inf;
        for(int j = 0;j < maxn;j++)
        {
            dis[i][j] = Map[i][j] = inf;
            path[i][j] = i;
        }
    }
}

void findpath(int i,int j,int k)    ///储存路径,大概为j->i->k->(j,输出环不用输出起点)
{
    for(num = 0;i-j;j = path[i][j])
        road[num++] = j;
    road[num++] = i;
    road[num++] = k;
}
int Floyed()
{
    int ans = inf;
    for(int k = 1;k <= n;k++)
    {
        for(int i = 1;i < k;i++)      ///k点不属于i->j的最短路一条,所以i<k
            for(int j = i+1;j < k;j++)
            {
                if(ans > dis[i][j]+Map[i][k]+Map[k][j])   ///更新最小环的值
                {
                    ans = dis[i][j]+Map[i][k]+Map[k][j];
                    findpath(i,j,k);
                }
            }
        for(int i = 1;i <= n;i++)   ///更新最短路
            for(int j = 1;j <= n;j++)
                if(dis[i][j] > dis[i][k]+dis[k][j])
                {
                    dis[i][j] = dis[i][k]+dis[k][j];
                    path[i][j] = path[k][j];
                }
    }
    return ans;
}
int main(void)
{
    while(scanf("%d%d",&n,&m) !=EOF)
    {
        init();
        for(int i = 1;i <= m;i++)
        {
            int a,b,c;
            scanf("%d%d%d",&a,&b,&c);
            if(Map[a][b] > c)
            {
                Map[a][b] = dis[a][b] = Map[b][a] = dis[b][a] = c;   ///双向边
            }
        }
        int ans = Floyed();
        if(ans == inf)
            printf("No solution.\n");
        else
        {
            for(int i = 0;i < num;i++)   ///输出路径
            {
                if(i < num-1)
                    printf("%d ",road[i]);
                else
                    printf("%d",road[i]);
            }
            printf("\n");
        }
    }
    return 0;
}
版权声明:excuse me?

POJ1734(floyd求最小环的路径)

题目:Sightseeing trip   题意:求一个图中最小环,输出路径。 #include #include #include using namespace std; ...
  • ACdreamers
  • ACdreamers
  • 2013年07月10日 16:16
  • 2203

poj 1734 Sightseeing trip(floyd求最小环并输出方案)

题目链接 Sightseeing trip Time Limit: 1000MS   Memory Limit: 65536K Total Submissions...
  • madaidao
  • madaidao
  • 2015年11月22日 21:43
  • 211

poj 1734 Sightseeing trip (floyd求最小环并记录路径)

点击打开题目链接 Description There is a travel agency in Adelton town on Zanzibar island. It has decided to...
  • qq_26564523
  • qq_26564523
  • 2015年11月23日 13:37
  • 239

最小环 floyd算法 poj 1734

Sightseeing trip Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 5994 ...
  • NLSQQ
  • NLSQQ
  • 2016年05月26日 11:19
  • 185

Floyd最小环算法

问题描述: 给你一张无向图,定义环为从i出发到达j然后从j返回i并且所有点都只经过一次(最少为3个点),求所有环当中经过路径                   最小的环 算法描述:首先容易想到的是暴...
  • qq_34731703
  • qq_34731703
  • 2017年01月25日 13:07
  • 688

POJ1734 Sightseeing trip 【Floyd】+【最小环】+【路径记录】

Sightseeing trip Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 4830 ...
  • u012846486
  • u012846486
  • 2014年08月19日 16:45
  • 799

floyd最小环 详细讲解

转载自:http://m.blog.csdn.net/blog/qq909157370/9225109# hdu 1599 find the mincost route(找无向图最小环) ...
  • Olga_jing
  • Olga_jing
  • 2015年11月19日 15:31
  • 2507

POJ 1734 最小环的路径

Sightseeing trip Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 6360 ...
  • sky_miange
  • sky_miange
  • 2016年09月22日 22:10
  • 110

poj 1734 (floyd求最小环并打印路径)

题意: 求图中的一个最小环,并打印路径。 解析: ans 保存最小环长度。 代码: #include #include #include #include #include #in...
  • u013508213
  • u013508213
  • 2015年02月10日 16:07
  • 310

POJ 1734 最小环

点击打开链接 题意:输出权值和最小的一个环 思路:在网上题解中弄得一份模版出处#include #include #include #include #include using nam...
  • Dan__ge
  • Dan__ge
  • 2016年09月11日 21:24
  • 505
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Poj 1734 Sightseeing trip floyd最小环
举报原因:
原因补充:

(最多只允许输入30个字)