HI, I am having problem with figure it a fast way to solve this problem so can anyone help me?
http://codeforces.net/contest/243/problem/A
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
HI, I am having problem with figure it a fast way to solve this problem so can anyone help me?
http://codeforces.net/contest/243/problem/A
Название |
---|
For each R, there are at most log(106) distinct values of F(L, R). For k-th bit, we find
max(i | i <= R and (bit k in a[i] = 1))
. These will be all possible values of L.Can you give a little bit more information?
Did you read this?