POJ 1860 Currency Exchange

第一次写Bellman-Ford，改了好几次居然AC了额。。

思路很简单，用BF判断有木有正环～

/**
    Bellman-Ford
*/
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int n,m,s,t1,t2;
double r[120][120],c[120][120],v,t3,t4,t5,t6,dist[120];
bool bellman_ford()
{
    int i,j,k;
    dist[s]=v;
    for (i=0; i<n-1; i++)
    {
        for (j=1; j<=n; j++)
        {
            for (k=1; k<=n; k++)
            {
                if (r[j][k] != 0)
                {
                    dist[k]=dist[k]<(dist[j]-c[j][k])*r[j][k]?(dist[j]-c[j][k])*r[j][k]:dist[k];
                }
            }
        }
    }
    for (j=1; j<=n; j++)
    {
        for (k=1; k<=n; k++)
        {
            if (r[j][k] != 0)
            {
                if (dist[k] < (dist[j]-c[j][k])*r[j][k])
                    return true;
            }
        }
    }
    return false;
}
int main()
{
    int i,j;
    scanf("%d%d%d%lf",&n,&m,&s,&v);
    memset(r,0,sizeof(r));
    for (i=1; i<=n; i++)
    {
        dist[i]=0;
    }
    for (i=0; i<m; i++)
    {
        scanf("%d%d%lf%lf%lf%lf",&t1,&t2,&t3,&t4,&t5,&t6);
        r[t1][t2]=t3;
        c[t1][t2]=t4;
        r[t2][t1]=t5;
        c[t2][t1]=t6;
    }
    if (bellman_ford())
        printf("YES\n");
    else
        printf("NO\n");
}