【Bellman-Ford算法】--判断正环poj 2240套利

题目来源: poj 2240

此题与poj1860相似。

#include <iostream>
#include<string>
#include <map>
using namespace std;
const int maxn = 40;
const int maxm = 10000;


struct node
{
    int u, v;
    double rate;
    node() {}
    node(int _u, int _v, double _rate) : u(_u), v(_v), rate(_rate) {}
};

node edge[maxm];
double d[maxn];

bool Bellman_Ford(int N, int M)
{
    fill(d, d + maxn, 0);
    d[0] = 1;
    for (int i = 0; i < N - 1; i++)
    {
        bool flag = false;
        for (int j = 0; j < M; j++)
        {
            double temp = d[edge[j].u] * edge[j].rate;
            if (temp > d[edge[j].v])
            {
                flag = true;
                d[edge[j].v] = temp;
            }
        }
        if (!flag)
        {
            return false;
        }
    }
    for (int j = 0; j < M; j++)
    {
        double temp = d[edge[j].u] * edge[j].rate;
        if (temp > d[edge[j].v])
        {
            return true;
        }
    }
    return false;
}

int main()
{
    int N;
    int count = 1;
    while (cin >> N && N != 0)
    {
        map<string, int> stringtoint;
        map<int, string> inttostring;
        int index = 0;
        for (int i = 0; i < N; i++)
        {
            string cur;
            cin >> cur;
            stringtoint[cur] = index;
            inttostring[index] = cur;
            index++;
        }
        int M;
        string s1, s2;
        double rate;
        cin >> M;
        for (int i = 0; i < M; i++)
        {
            cin >> s1 >> rate >> s2;
            int u = stringtoint[s1];
            int v = stringtoint[s2];
            edge[i] = node(u, v, rate);
        }
        if (Bellman_Ford(N, M))
        {
            cout << "Case " << count++ << ": Yes" << endl;
        }
        else
        {
            cout << "Case " << count++ << ": No" << endl;
        }
    }
    return 0;
}