- Hello
- Suppose we heve a balck box that can get a tree and each time we give it two vertex (for example u , v)it gives us lowest common ancestor (LCA) of u and v.
- Now you have an array A of size N and you have given M queri , each query have two integer L , R that want you to find minimum integer from L to R in A , use black box to answer each query.
- please write your solution in comment :))
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | ecnerwala | 3649 |
| 2 | Benq | 3581 |
| 3 | orzdevinwang | 3570 |
| 4 | Geothermal | 3569 |
| 4 | cnnfls_csy | 3569 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3531 |
| 8 | Radewoosh | 3521 |
| 9 | Um_nik | 3482 |
| 10 | jiangly | 3468 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 162 |
| 4 | TheScrasse | 159 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 151 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
→ Find user
→ Recent actions
- Hello
- I searched for SCC (strongly connected components) problems and I had found three good problems that I want to share with you. if you know more problem about this algorithm write in the comment :))
- check post
- Mr. Kitayuta's Technology
- capital city (from spoj)
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Apr/25/2024 16:28:55 (k2).
Desktop version, switch to mobile version.
Supported by
