HI, I am having problem with figure it a fast way to solve this problem so can anyone help me?
http://codeforces.com/contest/243/problem/A
# | User | Rating |
---|---|---|
1 | tourist | 3947 |
2 | jiangly | 3734 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3581 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3479 |
# | User | Contrib. |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | nor | 156 |
4 | adamant | 155 |
4 | cry | 155 |
4 | atcoder_official | 155 |
4 | -is-this-fft- | 155 |
8 | maroonrk | 153 |
9 | SecondThread | 147 |
10 | Petr | 146 |
HI, I am having problem with figure it a fast way to solve this problem so can anyone help me?
http://codeforces.com/contest/243/problem/A
Name |
---|
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?