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 ?
# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | adamant | 164 |
2 | awoo | 164 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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 !
Hi !
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 :)
In recent Codeforces contests , we see many problem with "Geometry" tag ! so I decide to learn Geometry algorithms and formula !
What must I do ?
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! :|
Name |
---|