« first day (2 days earlier)    last day (15 days later) » 

16:23
(Ignore this message)
"Let m(i,i) be the optimal solution when two officers cover i points and one of them is at the point i." Why do you want to include $m(i,i)$? "Each officer separately patrol a point" as said in your question, which is, as I understand, each officer patrols different points. Computing that one might not do extra harm, but it is certainly confusing and unnecessary, at least for me.
16:55
"m(i,j) = m(i-1,j) + d(i-1,i) &\text { when } 0\le j < i" That looks like a typo since i-1 might be greater than j.
(Please Ignore my the message just above)
Can you paste an example where my recurrence formula does not work? It would be great if you can paste your code to some online IDE such as repl.it so that I can run your code and my code as well against some input.

« first day (2 days earlier)    last day (15 days later) »