983. Minimum Cost For Tickets.cpp

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








// Dynamic Programming Memoization

class Solution {
public:

    int solve(vector<int> &days, vector<int> &costs, int i, vector<int> &dp){
        if(i>=days.size()) return 0;

        if(dp[i]>0) return dp[i];

        int op1=costs[0]+ solve(days, costs, i+1, dp);

        int k=i;
        for(;k<days.size();k++){
            if(days[k]>=days[i]+7)
                break;
        }
        int op2=costs[1]+ solve(days, costs, k, dp);

        k=i;
        for(;k<days.size();k++){
            if(days[k]>=days[i]+30)
                break;
        }
        int op3=costs[2]+ solve(days, costs, k, dp);

        dp[i]=min(op1, min(op2, op3));
        return min(op1, min(op2, op3));
    }

    int mincostTickets(vector<int>& days, vector<int>& costs) {
        int n=days.size();
        vector<int> dp(n, 0);
        return solve(days, costs, 0, dp);   // <days, costs, i, dp>

    }
};








// Recursive (TLE)

class Solution {
public:

    int solve(vector<int> &days, vector<int> &costs, int i){
        if(i>=days.size()) return 0;

        int op1=costs[0]+ solve(days, costs, i+1);

        int k=i;
        for(;k<days.size();k++){
            if(days[k]>=days[i]+7)
                break;
        }
        int op2=costs[1]+ solve(days, costs, k);

        k=i;
        for(;k<days.size();k++){
            if(days[k]>=days[i]+30)
                break;
        }
        int op3=costs[2]+ solve(days, costs, k);

        return min(op1, min(op2, op3));
    }

    int mincostTickets(vector<int>& days, vector<int>& costs) {
        int n=days.size();
        return solve(days, costs, 0);   // <days, costs, i>

    }
};