Minimum Cost For Tickets 旅行最小票价

In a country popular for train travel, you have planned some train travelling one year in advance.  The days of the year that you will travel is given as an array days.  Each day is an integer from 1 to 365.

Train tickets are sold in 3 different ways:

a 1-day pass is sold for costs[0] dollars;
a 7-day pass is sold for costs[1] dollars;
a 30-day pass is sold for costs[2] dollars.
The passes allow that many days of consecutive travel.  For example, if we get a 7-day pass on day 2, then we can travel for 7 days: day 2, 3, 4, 5, 6, 7, and 8.

Return the minimum number of dollars you need to travel every day in the given list of days.

 

Example 1:

Input: days = [1,4,6,7,8,20], costs = [2,7,15]
Output: 11
Explanation: 
For example, here is one way to buy passes that lets you travel your travel plan:
On day 1, you bought a 1-day pass for costs[0] = $2, which covered day 1.
On day 3, you bought a 7-day pass for costs[1] = $7, which covered days 3, 4, ..., 9.
On day 20, you bought a 1-day pass for costs[0] = $2, which covered day 20.
In total you spent $11 and covered all the days of your travel.
Example 2:

Input: days = [1,2,3,4,5,6,7,8,9,10,30,31], costs = [2,7,15]
Output: 17
Explanation: 
For example, here is one way to buy passes that lets you travel your travel plan:
On day 1, you bought a 30-day pass for costs[2] = $15 which covered days 1, 2, ..., 30.
On day 31, you bought a 1-day pass for costs[0] = $2 which covered day 31.
In total you spent $17 and covered all the days of your travel.
 

Note:

1 <= days.length <= 365
1 <= days[i] <= 365
days is in strictly increasing order.
costs.length == 3
1 <= costs[i] <= 1000

题意：一年365天中，days数组列出哪些天要旅游，
costs[0] 表示 1 天行程的票价；
costs[1] 表示连续某 7 天行程的票价；
costs[2] 表示连续某 30 天行程的票价；
问完成所有行程最少花费。

解法一：dp[i] 表示完成前 i 天行程需最小花费，那么
$dp[i]=dp[i-1],if第i天没有行程$
$$dp[i]=min(costs[0]+dp[i-1],costs[1]+dp[i-7],costs[2]+dp[i-30]),if第i天有行程$$

class Solution {
public:
    int mincostTickets(vector<int>& days, vector<int>& costs) {
        int n = days.size();//共多少天行程
        vector<int> dp(366);
        for(int i = 0; i < n; ++i)
            dp[days[i]] = 1;
        for(int i = 1; i < 366; ++i){//遍历一年中所有行程，n天的行程可能分布在全年
            if(dp[i] == 0)
                dp[i] = dp[i - 1];
            else
                dp[i] = min({costs[0] + dp[i - 1],
                             costs[1] + dp[max(0, i - 7)],
                             costs[2] + dp[max(0, i - 30)]});
        }
        return dp[days[n - 1]];
    }
};

由于最多每30天才更新一次，可以用滚动数组优化

class Solution {
public:
    int mincostTickets(vector<int>& days, vector<int>& costs) {
        unordered_set<int> dset(days.begin(), days.end());
        int n = days.size();
        vector<int> dp(30);
        for(int i = days.front(); i <= days.back(); ++i){
            if(dset.find(i) == dset.end())
                dp[i % 30] = dp[(i - 1) % 30];
            else
                dp[i % 30] = min({costs[0] + dp[(i - 1) % 30],
                             costs[1] + dp[max(0, i - 7) % 30],
                             costs[2] + dp[max(0, i - 30) % 30]});
        }
        return dp[days.back() % 30];
    }
};