题意
传送门 LCP 20. 快速公交
题解
前向 D F S DFS DFS 状态数显然过多;考虑后向 D F S DFS DFS,从终点搜索至起点。对于某个位置 x x x,有 3 3 3 种可能的花费最小的方式到达:直接从起点移动至 x x x;从 x / j u m p [ i ] x/jump[i] x/jump[i] 位置做公交至 x / j u m p [ i ] × j u m p [ i ] x/jump[i]\times jump[i] x/jump[i]×jump[i] 再向前动至 x x x;从 x / j u m p [ i ] + 1 x/jump[i]+1 x/jump[i]+1 位置做公交至 x / j u m p [ i ] × j u m p [ i ] + j u m p [ i ] x/jump[i]\times jump[i]+jump[i] x/jump[i]×jump[i]+jump[i] 再向后移动至 x x x。
状态转移要保证前驱的状态比当前状态更靠近起点,否则可能进入循环。因为是求极值,用 l o n g l o n g long long longlong 存取答案;取模运算应该在最后返回时进行。
class Solution
{
typedef long long ll;
public:
int inc, dec, mod = 1000000007;
vector<int> jump, cost;
map<int, ll> mp;
ll rec(int target)
{
if (target == 0)
return 0;
if (mp.find(target) != mp.end())
return mp[target];
ll res = (ll)inc * target;
for (int i = 0; i < jump.size(); i++)
{
ll rem = target / jump[i], mod = target % jump[i];
if (rem > 0)
{
res = min(res, (ll)rec(rem) + cost[i] + mod * inc);
}
if (rem + 1 < target && mod > 0)
{
res = min(res, (ll)rec(rem + 1) + cost[i] + (jump[i] - mod) * dec);
}
}
return mp[target] = res ;
}
int busRapidTransit(int target, int inc, int dec, vector<int> &jump, vector<int> &cost)
{
this->inc = inc, this->dec = dec;
this->jump = jump, this->cost = cost;
return rec(target) % mod;
}
};