Calvins's Game Hint

ranaabhinav50 · April 21, 2020, 7:06pm

So
dpf[] = dpf[j] + max[dpf[i-1], dpf[i-2]]
and
dpb[i] = … is the bottoms up approach right .
But I don’t understand the last relation

ans = max (ans , dpf[i] +dpb[i] - a[i] ) , what will be ans here ? please do mark any reference links if possible.

Robin_rst · April 22, 2020, 12:51pm

Better Solution
Refer this -:

github.com

robinrst/Dynamic-Programming/blob/master/CalvinSgame.cpp

#include        "algorithm"
#include        "iostream"
#include        "numeric"
#include        "iomanip"
#include        "cstring"
#include        "math.h"
#include        "bitset"
#include        "string"
#include        "vector"
#include        "ctime"
#include        "queue"
#include        "stack"
#include        "map"
#include        "set"

#include        "ext/pb_ds/assoc_container.hpp" // Common file
#include        "ext/pb_ds/tree_policy.hpp" // Including tree_order_statistics_node_update
#include        "ext/pb_ds/detail/standard_policies.hpp"

using namespace std;

This file has been truncated. show original

Robin_rst · October 4, 2020, 5:52am

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.