Min cost to divide a an array in three pieces

Question

Having an array of integer

I need to break this array in 3 pieces using 2 indexes P and Q (0 < P < Q < N-1)

Q and P must not be adjacent (Q-P>1)