983. Minimum Cost For Tickets (DP)

You have planned some train traveling one year in advance. The days of the year in which you will travel are given as an integer array days. Each day is an integer from 1 to 365.

Train tickets are sold in three different ways:

• a 1-day pass is sold for costs[0] dollars,
• a 7-day pass is sold for costs[1] dollars, and
• 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: 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.

The hint of this question is that consecutive day. 

As the days are discrete and some are consecutive, we can try to set up a dp array with max_element(days) length. If the day didn't show up in the day, we can just inherit the previous ans, otherwise, we try to deduct the current day by 1, 7, and 30 to change the tickets to find the best ans.

class Solution {
public:
    int mincostTickets(vector<int>& days, vector<int>& c) {
        //dp[i] = min(dp[i - 1] + costs[0], dp[i - j] + costs[1], dp[i - j] + costs[1])
        int n = days.size();
        vector<int> dp(days.back() + 1, 0);
        unordered_map<int, bool> m;
        for(int i = 0; i < n; i++){
            m[days[i]] = 1;
        }
        for(int i = 1; i <= days.back(); i++){
            if(!m[i]){
                dp[i] = dp[i - 1];
            }else{
                dp[i] = dp[max(0, i - 1)] + c[0];
                dp[i] = min(dp[i], dp[max(0, i - 7)] + c[1]);
                dp[i] = min(dp[i], dp[max(0, i - 30)] + c[2]);
            }
        }
        return dp[days.back()];
    }
};