一.原题链接:http://poj.org/problem?id=1860
二.题意:从一种货币换另一种货币有利率和佣金,用U表示当前货币,V表示要被换成的货币,V = (U-佣金)*利率。求一个人经过若干次货币交换,能不能回到原来的货币并获利?
三,思路:这是一个双边有向的带权图,因此肯定能回到原来的货币。(我们把货币看成点,把货币兑换点看成边,把转换的公式看成权)因此问题转换成在所有的路中,有没有一个成环的路,环路的权值的大于0的,有的话不收敛就可以多绕几圈再回来肯定会增加的。于是转换成Bellman_Ford判环问题,不过这题求的是最大路径,判的是正环。
四.代码:
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
using namespace std;
const int MAX_SIZE = 100009,
INF = 1<<29,
MOD = 1000000007;
//每条边表示 u->v
struct Edge
{
int u, v;
double rate, commission;
};
Edge edge[201];
int numOfNode, numOfEdge, start;
double V;
bool Bellman_Ford()
{
int i, j;
double dist[102];
memset(dist, 0, sizeof(dist));
dist[start] = V;
for(i = 1; i < numOfNode; i++){
for(j = 1; j <= numOfEdge; j++){
if(dist[edge[j].v] < (dist[edge[j].u]-edge[j].commission)*edge[j].rate){
dist[edge[j].v] = (dist[edge[j].u]-edge[j].commission)*edge[j].rate;
}
}
}
for(j = 1; j <= numOfEdge; j++)
if(dist[edge[j].v] < (dist[edge[j].u]-edge[j].commission)*edge[j].rate)
return true;
return false;
}
int main()
{
//freopen("in.txt", "r", stdin);
int i, j, curA, curB;
double rateAB, rateBA, comAB, comBA;
cin>>numOfNode>>numOfEdge>>start>>V;
numOfEdge *= 2;
for(i = 1; i <= numOfEdge; i += 2){
cin>>curA>>curB>>rateAB>>comAB>>rateBA>>comBA;
edge[i].u = edge[i+1].v = curA;
edge[i].v = edge[i+1].u = curB;
edge[i].rate = rateAB, edge[i].commission = comAB;
edge[i+1].rate = rateBA, edge[i+1].commission = comBA;
}
if(Bellman_Ford())
printf("YES\n");
else
printf("NO\n");
}