【HDU 1599】find the mincost route 【最小环】

来源：互联网发布：淘宝是什么公司的编辑：程序博客网时间：2024/04/30 15:58

#include<bits/stdc++.h>using namespace std;#define M 1010#define N 110#define INF (1<<28)int n,m;int dp[N][N],f[N][N];void solve(){    for(int i=1;i<=n;i++)        for(int j=1;j<=n;j++)            f[i][j]=dp[i][j]=INF;    int a,b,c,ans=INF;      for(int i=1;i<=m;i++)        cin>>a>>b>>c,dp[a][b]>c?f[a][b]=f[b][a]=dp[a][b]=dp[b][a]=c:1;                  for(int k=1;k<=n;k++){        for(int i=1;i<k;i++){            for(int j=i+1;j<k;j++){                ans = min(ans,dp[i][j]+f[i][k]+f[k][j]);                            }                       }        for(int i=1;i<=n;i++){            for(int j=1;j<=n;j++){                dp[i][j] = min(dp[i][j],dp[i][k]+dp[k][j]);            }                   }       }    if(ans==INF)cout<<"It's impossible."<<endl;    else cout<<ans<<endl;}int main(){    freopen("data.in","r",stdin);    freopen("data.out","w",stdout);    while(cin>>n>>m)solve();    return 0;}

免费赠送数据生成器拿好不写。

#!usr/bin/env python#-*- coding: utf-8 -*-import sysimport randomfp = open("data.in","w")sys.stdout = fpn = random.randint(1,101)m = random.randint(1,1001)print n,mfor i in range(0,n):    for j in range(0,n):        u = random.randint(1,n+1)        v = random.randint(1,n+1)        w = random.randint(1,101)        print u,v,w    print

对拍程序

@echo off:loopmkdata.pyhdu1599.exe~tmp.exefc data.out stddata.outif not errorlevel 1 goto looppausegoto loop

1 0