Exchange Rates

Exchange Rates

时间: 1ms        内存:128M

描述:

Now that the Loonie is hovering about par with the Greenback, you have decided to use your $1000 entrance scholarship to engage in currency speculation. So you gaze into a crystal ball which predicts the closing exchange rate between Canadian and U.S. dollars for each of the next several days. On any given day, you can switch all of your money from Canadian to U.S. dollars, or vice versa, at the prevailing exchange rate, less a 3% commission, less any fraction of a cent.

Assuming your crystal ball is correct, what's the maximum amount of money you can have, in Canadian dollars, when you're done?

 

输入:

The input contains a number of test cases, followed by a line containing 0. Each test case begins with 0 <d ≤ 365, the number of days that your crystal ball can predict. d lines follow, giving the price of a U.S. dollar in Canadian dollars, as a real number.

输出:

For each test case, output a line giving the maximum amount of money, in Canadian dollars and cents, that it is possible to have at the end of the last prediction, assuming you may exchange money on any subset of the predicted days, in order.

示例输入:

3
1.0500
0.9300
0.9900
2
1.0500
1.1000
0

示例输出:

1001.60
1000.00

提示:

参考答案(内存最优[956]):

#include <stdio.h>

#define ROUND 0
int cad[10000];
int usd[10000];

double rate[10000];

int initcad = 100000;
int initusd = 0;
double commission = .03;

double max(double a, double b, double c) {
    if(a>=b && a>=c) return a;
    if(b>=c) return b;
    return c;
}

main() {
    int n, i;
    while(1) {
    scanf("%d", &n);
    if(!n) break;
    for(i = 0; i < n; i++) {
        scanf("%lf", rate + i);
    }

    for(i = 0; i < n; i++) {
        cad[i+1] = max(initcad + initusd*rate[i]*(1-commission) + ROUND,
                cad[i], usd[i]*rate[i]*(1-commission) + ROUND);
        usd[i+1] = max(initusd + initcad/rate[i]*(1-commission) + ROUND,
                usd[i], cad[i]/rate[i]*(1-commission) + ROUND);
        //printf("%d %d\n", usd[i+1], cad[i+1]);
    }

    printf("%01d.%02d\n", cad[n]/100, cad[n]%100);
    }
}

参考答案(时间最优[12]):

#include <stdio.h>

#define ROUND 0
int cad[10000];
int usd[10000];

double rate[10000];

int initcad = 100000;
int initusd = 0;
double commission = .03;

double max(double a, double b, double c) {
    if(a>=b && a>=c) return a;
    if(b>=c) return b;
    return c;
}

main() {
    int n, i;
    while(1) {
    scanf("%d", &n);
    if(!n) break;
    for(i = 0; i < n; i++) {
        scanf("%lf", rate + i);
    }

    for(i = 0; i < n; i++) {
        cad[i+1] = max(initcad + initusd*rate[i]*(1-commission) + ROUND,
                cad[i], usd[i]*rate[i]*(1-commission) + ROUND);
        usd[i+1] = max(initusd + initcad/rate[i]*(1-commission) + ROUND,
                usd[i], cad[i]/rate[i]*(1-commission) + ROUND);
        //printf("%d %d\n", usd[i+1], cad[i+1]);
    }

    printf("%01d.%02d\n", cad[n]/100, cad[n]%100);
    }
}

题目和答案均来自于互联网,仅供参考,如有问题请联系管理员修改或删除。

点赞

发表评论

电子邮件地址不会被公开。必填项已用 * 标注