The function f(day, last) calculates the maximum points from day 0 to day, given that the last activity performed was last.

last ranges from 0 to 2 for activities and is set to 3 initially, meaning no activity was done the day before the first call.

At each step, we try all activities not equal to last and recursively calculate the total points.

We store intermediate results in a 2D vector dp to avoid recalculating them.

Code

#include <bits/stdc++.h>
using namespace std;

// Recursive function to calculate the maximum points for the ninja training
int f(int day, int last, vector<vector<int>> &points, vector<vector<int>> &dp) {
    // If the result for this day and last activity is already calculated, return it
    if (dp[day][last] != -1) return dp[day][last];

    // Base case: When we reach the first day (day == 0)
    if (day == 0) {
        int maxi = 0;
        // Calculate the maximum points for th