Please, try EDU on Codeforces! New educational section with videos, subtitles, texts, and problems. ×

Shubham_1007's blog

By Shubham_1007, history, 3 years ago, In English,

Problem: http://www.spoj.com/problems/ADAMOLD/ I unable to think of approach better than O(k*n^2)

 
 
 
 
  • Vote: I like it
  • -3
  • Vote: I do not like it

»
3 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Good day to you,

I would recommend you to take peek here, and learn the proper one :)

Good Luck & Have Nice Day ^_^

  • »
    »
    3 years ago, # ^ |
      Vote: I like it +5 Vote: I do not like it

    Thanks for your reply , trying hard for this problem

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    hey, I don't know if you are active are not but i am stuck with this problem. I am continuously getting TLE. Moreover I don't understand how to apply dc optimization. Any hints would be highly appreciated.