HDU1217
题意:询问是否存在一种货币交换,使最终的收益增加。
题解:注意货币交换是单向的。floyd算法求最长路并且进行判环
代码:
#include <bits/stdc++.h>
using namespace std;
int const N = 30 + 10;
double const inf = 0x7f7f7f7f;
map<string,int>mp;
int n,m;
double a[N][N];
void Floyd(){
for(int k=1;k<=n;k++){
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
a[i][j] = max(a[i][j],a[i][k] * a[k][j]);
}
}
}
}
int main(){
int T = 0;
while(~scanf("%d",&n)&&n){
memset(a,0,sizeof(a));
int cnt = 0;
mp.clear();
for(int i=0;i<n;i++){
string s;
cin>>s;
if(!mp[s]) mp[s] = ++cnt;
}
scanf("%d",&m);
for(int i=0;i<m;i++){
string s1,s2;
double rate;
cin>>s1>>rate>>s2;
a[mp[s1]][mp[s2]] = rate;
}
Floyd();
bool flag = false;
for(int i=1;i<=n;i++)
if(a[i][i] > 1) flag = true;
printf("Case %d: ",++T);
if(flag) printf("Yes\n");
else printf("No\n");
}
return 0;
}