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.
# | 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 | awoo | 164 |
2 | adamant | 164 |
4 | TheScrasse | 159 |
4 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | 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 !
Name |
---|