UVA 104 - Arbitrage

这道题的题意是：给出n种国家的货币汇率，一定金额的某种货币经过一系列汇率变换后再换成原来货币，金额增加了，求出这样的一个变换，要求变换步数最少。

这道题实际是一道动态规划题，设Matrix（i,j,k）表示i经过k部变换，到j的最大金额，我们有递推公式Matrix(i,j,k) >?= matrix(i,j,k-1)*Matrix(i,j,1)，然后让k从2开始直到n，判断Matrix(i,i,k)是否符合条件。这个问题解决了，还有一个问题就是打印路径，设一个path(i,j,k)如果用flord来实现，则其表示第k-1步所交换的某种汇率，若用经典动归来解，则表示i交换到j，k个交换的汇率。

flord程序代码：

#include<iostream> #include<cstdio> #include<cstring> #include<cmath> using namespace std; #define MAXN 25 #define INF 1000000 #define exp 0.01 double Profit[MAXN][MAXN][MAXN]; int Trace[MAXN][MAXN][MAXN], oTrace[MAXN]; int nCase; int flord() { for(int step = 2; step <= nCase; step++) for(int k = 1; k <= nCase; k++) for(int i = 1; i <= nCase; i++) for(int j = 1; j <= nCase; j++){ if(Profit[i][j][step] < Profit[i][k][step - 1] * Profit[k][j][1]){ Profit[i][j][step] = Profit[i][k][step - 1] * Profit[k][j][1]; Trace[i][j][step] = k; if(Profit[i][j][step] > 1.01 && i == j){ oTrace[0] = step; oTrace[step + 1] = i; while(step > 0){ oTrace[step] = Trace[i][j][step]; j = Trace[i][j][step]; step--; } return 1; } } } return 0; } int main() { //freopen("input.txt", "r", stdin); while(scanf("%d", &nCase) == 1) { memset(Profit, 0, sizeof(Profit)); memset(Trace, 0, sizeof(Trace)); for(int i = 1; i <= nCase; i++) for(int j = 1; j <= nCase; j++){ if(i != j) { scanf("%lf", &Profit[i][j][1]); }else Profit[i][j][1] = 1.0; Trace[i][j][1] = i; } if(flord()) { for(int i = 1; i <= oTrace[0] + 1; i++) { printf("%d", oTrace[i]); if(i != oTrace[0] + 1) printf(" "); else printf("/n"); } } else printf("no arbitrage sequence exists/n"); } return 0; }  

经典动归代码：

#include<iostream> #include<cstdio> #include<cstring> using namespace std; #define MAXN 25 double Matrix[MAXN][MAXN][MAXN]; int nPath[MAXN][MAXN][MAXN]; int nCase; void dp() { double t; for(int step = 2; step <= nCase; step++){ for(int i = 1; i <= nCase; i++){ for(int j = 1; j <= nCase; j++){ for(int k = 1; k <= nCase; k++){ if((t = Matrix[i][k][step - 1] * Matrix[k][j][1]) > Matrix[i][j][step]){ Matrix[i][j][step] = t; for(int m = 2; m < step; m++) { nPath[i][j][m] = nPath[i][k][m]; } nPath[i][j][step] = k; } } } } for(int i = 1; i <= nCase; i++){ if(Matrix[i][i][step] > 1.01){ printf("%d", i); for(int j = 2; j <= step; j++) printf(" %d", nPath[i][i][j]); printf(" %d/n", i); return ; } } } printf("no arbitrage sequence exists/n"); } int main() { //freopen("input.txt", "r", stdin); while(scanf("%d", &nCase) == 1){ memset(nPath, 0, sizeof(nPath)); memset(Matrix, 0, sizeof(Matrix)); for(int i = 1; i <= nCase; i++) for(int j = 1; j <= nCase; j++){ if(i != j){ scanf("%lf", &Matrix[i][j][1]); }else Matrix[i][j][1] = 1; nPath[i][j][1] = i; } dp(); } return 0; }