Hi, Round #288 was Div. 1 and Div. 2 yesterday.
What happened ? Now I see it's a Div .2 Only contest !
Is this a mistake ? Or plan changed ?
Hi, bro !
I was trying to solve problem 126C - E-reader Display !
In this problem n is at most 2000, and my algorithm was O(n*n*log n).
getting input with cin : 5857002
getting input with scanf : 5858216
But my code got TLE , and I can't find it reason.
If you know it, please tell me !
I am trying to answer problem 155 at ACM.SGU.RU site .
My algortihm is sort by a[i] elements , then create a BST by k[i] elements.
I know my algorithm in worse case is O(n^2) and n can be 50000 ! So my answer get TLE .
What can I do for this problem ? Is my algorithm wrong or can be optimize ?
Hi :) We have two string with same size ! ( n = strings.size() )
I want an algorithm with O(n.lg n) , to find LCS of this strings .
What is best Order of this problem ? I can find it with O(n^2) by using dp !
sry 4 my bad English! :|