Size of a block is [i∗K+1,min((i+1)∗k,N)] ?
That makes no sense. Very poorly written problem statement, please clarify it.
MAX SUM K-PARTITION - size of each block as [i∗K+1,min((i+1)∗k,N)]
It simply means divide array in sizes of k. The last block might contain number of elements less than k.
For eg, array size 10,k=3
you get sizes 3,3,3,1.
Thats what it means.
I hope now its clear to you. Hit the like button if so 
and mark the thread resolved 
1 Like
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.