这一题我一开始当作动态规划问题来做,但是实际最后发现还是有很大漏洞的。主要是这样一个情况:当当前站点的油价大于前一个站点的油价是,它们俩的油价可能都还小于再之前一个站点的油价。像这样的情况就要再向前搜索。这样的话判断条件还是挺复杂的。
后来去参考了大神柳婼的代码,主要是两个问题,一是将终点也当作一个站点,加入判断。二是在一个站点向前方可到达范围内搜索,一跳过中间高价站点,到达下一个低价站点。
代码源自:https://www.liuchuo.net/archives/2461
感谢!
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const int inf = 99999999;
struct station {
double price, dis;
};
bool cmp1(station a, station b) {
return a.dis < b.dis;
}
int main() {
double cmax, d, davg;
int n;
scanf("%lf%lf%lf%d", &cmax, &d, &davg, &n);
vector<station> sta(n + 1);
sta[0] = {0.0, d};
for(int i = 1; i <= n; i++)
scanf("%lf%lf", &sta[i].price, &sta[i].dis);
sort(sta.begin(), sta.end(), cmp1);
double nowdis = 0.0, maxdis = 0.0, nowprice = 0.0, totalPrice = 0.0, leftdis = 0.0;
if(sta[0].dis != 0) {
printf("The maximum travel distance = 0.00");
return 0;
} else {
nowprice = sta[0].price;
}
while(nowdis < d) {
maxdis = nowdis + cmax * davg;
double minPriceDis = 0, minPrice = inf;
int flag = 0;
for(int i = 1; i <= n && sta[i].dis <= maxdis; i++) {
if(sta[i].dis <= nowdis) continue;
if(sta[i].price < nowprice) {
totalPrice += (sta[i].dis - nowdis - leftdis) * nowprice / davg;
leftdis = 0.0;
nowprice = sta[i].price;
nowdis = sta[i].dis;
flag = 1;
break;
}
if(sta[i].price < minPrice) {
minPrice = sta[i].price;
minPriceDis = sta[i].dis;
}
}
if(flag == 0 && minPrice != inf) {
totalPrice += (nowprice * (cmax - leftdis / davg));
leftdis = cmax * davg - (minPriceDis - nowdis);
nowprice = minPrice;
nowdis = minPriceDis;
}
if(flag == 0 && minPrice == inf) {
nowdis += cmax * davg;
printf("The maximum travel distance = %.2f", nowdis);
return 0;
}
}
printf("%.2f", totalPrice);
return 0;
}