UVA 10048 Audiophobia

最新推荐文章于 2024-04-07 15:27:36 发布

转载最新推荐文章于 2024-04-07 15:27:36 发布 · 125 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/Commence/p/4006475.html

本文深入讲解了一种基于动态规划(DP)的算法实现，通过一个类似Floyd算法的例子，详细展示了如何进行状态转移，解决路径寻找和最短路径计算的问题。代码中包含了完整的C++实现，包括输入输出、初始化距离矩阵、状态转移以及结果输出等步骤。

简单DP。转移就可以。比较像floyd

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <stack>
#include <queue>
#include <cctype>
#include <cstdio>
#include <string>
#include <vector>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define PI 3.1415926535897932626
using namespace std;
int gcd(int a, int b) {return a % b == 0 ? b : gcd(b, a % b);}
int C,S,Q;
#define MAXN 110
int dis[MAXN][MAXN];
int main()
{
    //freopen("sample.txt","r",stdin);
    int kase = 1;
    bool first = false;
    while (scanf("%d%d%d",&C,&S,&Q)!=EOF)
    {
        if (C == 0 && S == 0 && Q == 0) break;
        if (first) putchar('\n');
        else first = true;
        memset(dis,-1,sizeof(dis));
        for (int i = 0; i <= C; i++) dis[i][i] = 0;
        while (S--)
        {
            int u,v,w;
            scanf("%d%d%d",&u,&v,&w);
            dis[u][v] = dis[v][u] = w;
        }
        for (int k = 1; k <= C; k++)
            for (int i = 1; i <= C; i++)
              for (int j = 1; j <= C; j++)
        {
            if (dis[i][k] != -1 && dis[k][j] != -1)
            {
                if (dis[i][j] != -1) dis[i][j] = min (max(dis[i][k],dis[k][j]),dis[i][j]);
                else dis[i][j] = max(dis[i][k],dis[k][j]);
            }
        }
        
        printf("Case #%d\n",kase++);
        while (Q--)
        {
            int u,v;
            scanf("%d%d",&u,&v);
            if (dis[u][v] != -1) printf("%d\n",dis[u][v]);
            else puts("no path");
        }
    }
    return 0;
}

转载于:https://www.cnblogs.com/Commence/p/4006475.html