Can someone explain the statement of the HYPERSPACEPATHS prob. from the INOI Practice Server.. If possible, please describe the solution... asked 01 Jan '15, 02:28

@roxtar123, i think there is slight mistake in your solution. DP1(i) denotes min sum possible by a single section of size k using 1..i plots. DP2(i) denotes min sum possible by a single section of size k using i..n plots Loop i from 1 to n1 Take min of DP1(i)+DP2(i+1) over all i What say? @arpanb8, please be patient. Why such a hurry? People will reply when they are free, no one is under any obligation to answer your queries and yet people are trying to help. So please be a little grateful and less impatient. answered 01 Jan '15, 14:56

Make 2 DP Arrays. DP1(i) denotes min sum possible by a single section of size k using plots 1..i . DP2(i) denotes min sum possible by a single section of size k using plots i..n . Loop i from 1 to n1: Take min of DP1(i)+DP2(i+1) over all i. EDIT Sorry, My bad. I did not read the problem carefully. answered 01 Jan '15, 11:29

@knsn  If you loop from i less than K then it would not be possible to pick a K sized plot. Same reason for i greater than NK. Infact DP1 will start from DP1(K) = Sum of first K elements and DP2 will start DP2(NK+1) = Sum of last K elements. answered 01 Jan '15, 15:36
