总时间限制:
1000ms
内存限制:
65536kB
描述
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
来源
Waterloo
#include <iostream>
#include <iomanip>
#include <vector>
using namespace std;
// 比较两个数大小,返回较大值
int max(int x, int y) {
return x > y ? x : y;
}
int main() {
int n;
while (true) {
cin >> n;
// 当输入为 0 时,结束程序
if (n == 0) {
break;
}
vector<double> exchangeRates(n + 1);
for (int i = 1; i <= n; i++) {
cin >> exchangeRates[i];
}
// c 表示当前持有的加元数量,u 表示当前持有的美元数量
int c = 100000;
int u = 0;
for (int i = 1; i <= n; i++) {
int cc = c;
int uu = u;
// 尝试将美元兑换成加元
c = max(c, static_cast<int>(uu * exchangeRates[i] * 0.97));
// 尝试将加元兑换成美元
u = max(u, static_cast<int>(cc / exchangeRates[i] * 0.97));
}
// 输出最终持有的加元数量,保留两位小数
cout << fixed << setprecision(2) << static_cast<double>(c) / 100.0 << endl;
}
return 0;
}
477

被折叠的 条评论
为什么被折叠?



