Los_Angelos_Laycurse's blog

By Los_Angelos_Laycurse, 9 years ago, In English

http://codeforces.net/problemset/problem/542/B.

my n^2*log(n) solution with prunning got Accepted and worst case is n==10000,run 951ms(not n==200000),hope admin can add a lot of big test cases,I think test cases for a problem at least 100+ is suitable(with a lot of construct test cases),but this problem there is only 37 cases....

»
9 years ago, # |
  Vote: I like it +6 Vote: I do not like it

hello

»
9 years ago, # |
  Vote: I like it -13 Vote: I do not like it

You are my hero, dude!