I can't remember the exact details, but you should use a deque in order to improve the DP to run in O(N*K). If this hint is doesn't help you enough, I'll think of the problem in a couple of days and post a more detailed solution.

hm.. I still don't get the idea how to solve it with a deque Further helps needed

hm.. thx for replying . I would be happy if someone can give me some hints and I tried it myself 

Hi,
I am stuck in this problem  , could someone explain how to solve it in O(N*K)?

Thanks

Hi,
I am stuck in this problem  , could someone explain how to solve it in O(N*K)?

Thanks

any body here? Please help me

It would be nice if you would edit your previous messages when consecutively posting on the same subject.

ah.. sorry for that. Ok I will do it from now on. Thx for the advice

Unfortunately, I don't know other people outside Romania who use this site. I got this site when I google about something related to programming... after several hours googling, I finally found this site and I'm interested in it. 

Thanks for your reply. Well google translator is really a great tool which helps me to translate those problems . But some problems are not translated correctly. I hope one day, there will be an English version for this site. 

Hi, dude..
I'm non Rumanian but I love this site. I just found something really annoying.
http://infoarena.ro/job_detail/377564

My 8-th test case:
8   532ms   340kb   Time limit exceeded.   0

My 9-th test case:
9   600ms   380kb   OK   10

Well we can clearly see that the 8th test case( 532ms which is smaller than 0.6 sec) got TLE while my 9th test case (exactly 0.6 sec) got OK. Can someone explain how does it happen?

Thanks for your attention.