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 ?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | nor | 157 |
4 | atcoder_official | 156 |
4 | cry | 156 |
6 | -is-this-fft- | 155 |
7 | maroonrk | 154 |
8 | adamant | 153 |
9 | Um_nik | 151 |
10 | djm03178 | 146 |
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! :|
Название |
---|