Maximize cost in graph with variable costs
There's no need to introduce a graph; the problem can be solved by a straightforward dynamic programming algorithm.  The running time will be $O(n)$, where $n$ is the number of days.