Today I met a hard problem —— SPOJ 3110 the link to problem
And the problem needs a searching algorithm , or maybe other algorithms.
I would appreciate it if you could help me with this problem.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | SecondThread | 145 |
9 | pajenegod | 145 |
Today I met a hard problem —— SPOJ 3110 the link to problem
And the problem needs a searching algorithm , or maybe other algorithms.
I would appreciate it if you could help me with this problem.
I saw that there are ODT and Ynoi in the problem makers. That will remind me and you (especially some old CF users) of CF #896.
These two men are genious Chinese data-structure makers, I'm convienced that this round will be a poisonous and difficult data-structure round. It's so possible (very very high rate) that there will be Mos-algorithm or Sqrt-tech-data-structures.
Please Forgive my broken English and wish you all have a high rating and a happy codeforces round !
Название |
---|