POJ -1860 Currency Exchange（Bellman-Ford，判正环）

Currency Exchange

Time Limit: 1000MS	Memory Limit: 30000K

Description

Several currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies and performs exchange operations only with these currencies. There can be several points specializing in the same pair of currencies. Each point has its own exchange rates, exchange rate of A to B is the quantity of B you get for 1A. Also each exchange point has some commission, the sum you have to pay for your exchange operation. Commission is always collected in source currency.
For example, if you want to exchange 100 US Dollars into Russian Rubles at the exchange point, where the exchange rate is 29.75, and the commission is 0.39 you will get (100 - 0.39) * 29.75 = 2963.3975RUR.
You surely know that there are N different currencies you can deal with in our city. Let us assign unique integer number from 1 to N to each currency. Then each exchange point can be described with 6 numbers: integer A and B - numbers of currencies it exchanges, and real RAB, CAB, RBA and CBA - exchange rates and commissions when exchanging A to B and B to A respectively.
Nick has some money in currency S and wonders if he can somehow, after some exchange operations, increase his capital. Of course, he wants to have his money in currency S in the end. Help him to answer this difficult question. Nick must always have non-negative sum of money while making his operations.

Input
The first line of the input contains four numbers: N - the number of currencies, M - the number of exchange points, S - the number of currency Nick has and V - the quantity of currency units he has. The following M lines contain 6 numbers each - the description of the corresponding exchange point - in specified above order. Numbers are separated by one or more spaces. 1<=S<=N<=100, 1<=M<=100, V is real number, 0<=V<=103.
For each point exchange rates and commissions are real, given with at most two digits after the decimal point, 10-2<=rate<=102, 0<=commission<=102.
Let us call some sequence of the exchange operations simple if no exchange point is used more than once in this sequence. You may assume that ratio of the numeric values of the sums at the end and at the beginning of any simple sequence of the exchange operations will be less than 104.

Output
If Nick can increase his wealth, output YES, in other case output NO to the output file.

Sample Input
3 2 1 20.0
1 2 1.00 1.00 1.00 1.00
2 3 1.10 1.00 1.10 1.00

Sample Output
YES

题意：n种钱，m个兑换点，当前有s号钱币，价值是v。下面m行，6个数字分别表示a号钱币，b号钱币，a换成b的手续费和汇率，b换成a的手续费和汇率。问能不能经过几次兑换，使钱变多？

Tips：
负权回路：
在一个图里每条边都有一个权值（有正有负)
如果存在一个环（从某个点出发又回到自己的路径），而且这个环上所有权值之和是负数，那这就是一个负权环，也叫负权回路
存在负权回路的图是不能求两点间最短路的，因为只要在负权回路上不断兜圈子，所得的最短路长度可以任意小。
相反地，
正权回路：
如果存在一个环（从某个点出发又回到自己的路径），而且这个环上所有权值之和是正数，那这就是一个正权环，也叫正权回路
存在正权回路的图是不能求两点间最长路的，因为只要在正权回路上不断兜圈子，所得的最短路长度可以任意大。

在这里，a换成b就像是a镇到b镇，能换多少钱就是路程或者时间之类的，而且这是一个无向图，a可以到b，b也可以到a，现在问能不能经过几次兑换（移动），使钱（用时/路程）变多，这就符合正权回路的定义。

#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cstdio>
#include <queue>
#include <set>
using namespace std;
typedef long long ll;
#define eps 1e-8
#define INF 0x3f3f3f3f
const int N=105;

struct date
{
    int a, b;
    double r, c;
};
date ee[N*2];

double dist[N];
int n, m, s;
double v;
int cnt;

int bellman_ford()
{
    for(int i=1;i<=n;i++)
        dist[i]=0;
    dist[s]=v;
    for(int j=1; j<n; j++)
    {
        int flag=0;
        for(int i=0; i<cnt; i++)
        {
            date e=ee[i];
            double temp=(dist[e.a]-e.c)*e.r;
            if(temp>dist[e.b])
            {
                dist[e.b]=temp;
                flag=1;
            }
        }
        if(flag==0)//本次循环没有再更新
            return 0;//没有正环回路
    }
    for(int i=0; i<cnt; i++)
    {
        date e=ee[i];
        double temp=(dist[e.a]-e.c)*e.r;
        if(temp>dist[e.b])
            return 1;//有正环回路
    }
    return 0;//没有正环回路
}

int main()
{
    while(scanf("%d%d%d%lf", &n, &m, &s, &v)!=EOF)
    {
        int a, b;
        double rab, rba, cab, cba;
        cnt=0;
        for(int i=0; i<m; i++)
        {
            scanf("%d%d%lf%lf%lf%lf",&a,&b,&rab,&cab,&rba,&cba);
            ee[cnt].a=a, ee[cnt].b=b, ee[cnt].r=rab, ee[cnt].c=cab;
            cnt++;
            ee[cnt].a=b, ee[cnt].b=a, ee[cnt].r=rba, ee[cnt].c=cba;
            cnt++;
        }
        int ans=bellman_ford();
        if(ans)
            printf("YES\n");
        else
            printf("NO\n");
    }
    return 0;
}