Блог пользователя OneClickAC

Автор OneClickAC, история, 8 лет назад, По-английски

Hi , I am a beginner programmer and i need some help . Basically i was working on a problem on codeforces (Problem Link-> http://codeforces.me/problemset/problem/600/B)(using java) and i am getting TLE verdict. I am not able to understand why i am getting so as I am using map for insertion and retrieval of values which is a form of red black tree and takes logarithmic time . My code is exceeding limit on test 20 .. Submission link->http://codeforces.me/contest/600/submission/23908885

Please help me in understanding the reason behind this and if possible , also tell about how to overcome this problem of Time Limit..

Code Link->http://pastebin.com/tH39VQkR

  • Проголосовать: нравится
  • -3
  • Проголосовать: не нравится

»
8 лет назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

I got AC by changing int a[]=new int [n]; to Integer a[]=new Integer [n]; check this blog for more details.