地址:https://pintia.cn/problem-sets/994805342720868352/problems/994805458722734080
这道题是贪心模拟,感觉考虑的情况特别多,还有一点特别坑,我没全用double,now_cap这个变量没用double,然后double一直出不来
参考博客:https://blog.csdn.net/xyt8023y/article/details/46425435
对于这道题目,我们分如下的情况进行讨论。
对于当前站点S,所能到达的最大范围即满油量所能到达的距离,设满油量能前进的距离为maxToGo,则在S到S+maxToGo范围内,分如下情况进行考虑:
Ⅰ此范围内有加油
1、有比当前站点便宜的加油站,因为只从最小的局部考虑问题,如果有多个比当前便宜的,到达那个最近的而不是最便宜的(只需要在找到第一个比S便宜的站点时break即可)
2、全部比S更贵(易错点)
2.1 如果从S无法到达终点,则选择最便宜的那个,从S加满油到达那个站点
2.2 如果从S可以直接到达终点,则从S加油至能到达终点,直接开到终点。
Ⅱ此范围内无加油
1、如果从S可以直接到达终点,则加到能到达终点,直接到达
2、如果从S无法到达终点,加满油,能跑多远跑多远
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int inf = 0x3f3f3f3f;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
double cmax,dis,d;
int n;
typedef struct Node{
double price;
double distance;
friend bool operator < (const Node &p,const Node &q){
return p.distance < q.distance;
}
}Node;
vector<Node>ve;
int main()
{
scanf("%lf %lf %lf %d",&cmax,&dis,&d,&n);
for(int i = 0;i < n;++i){
double p,q;
scanf("%lf %lf",&p,&q);
ve.pb((Node){p,q});
}
sort(ve.begin(),ve.end());
if(ve[0].distance > 0){
printf("The maximum travel distance = 0.00\n");
return 0;
}
int cur = 0;
double sum = 0;
double now_cap = 0;
double need;
while(cur < n)
{
double stprice = ve[cur].price;
double stdis = ve[cur].distance;
bool flag = false;
//检测是否有可达到的终点
int p = -1;
for(int i = cur + 1;i < n;++i){
if(ve[i].distance - stdis <= cmax * d){
flag = true;
if(ve[i].price < stprice){
p = i;
break;
}
}else{
break;
}
}
if(!flag){//无终点可达
need = dis - stdis;
if(need <= cmax * d){
if(now_cap * d < need){
need -= now_cap * d;
sum += (need / d) * stprice;
}
break;
}else{
printf("The maximum travel distance = %.2lf\n",stdis + cmax * d);
return 0;
}
}else{
if(p != -1){
need = ve[p].distance - stdis;
if(now_cap * d < need){
need -= now_cap * d;
sum += need / d * stprice;
now_cap = 0;
cur = p;
}else{
now_cap -= (need / d);
cur = p;
}
}else{
//都比现在所处站点的价格贵
if(dis - stdis <= cmax * d){
need = dis - stdis;
if(now_cap * d < need){
sum += (need - now_cap * d) / d * stprice;
}
break;
}
//找到最小的
double MIN = inf;
int q;
for(int i = cur + 1;i < n;++i){
if(ve[i].distance - stdis < cmax * d){
if(ve[i].price < MIN){
MIN = ve[i].price;
q = i;
}
}else break;
}
cur = q;
sum += (cmax - now_cap) * stprice;
now_cap = cmax - (ve[q].distance - stdis) / d;
}
}
}
printf("%.2lf\n",sum);
return 0;
}