# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
Name |
---|
Indeed, multiplying everything by 2 helps because you can make each person enter at an even time and leave at an odd time, so you don't have to worry about what to count first.
can you give me a case where marking [a +1] [b+1 -1] fails. And thank you tenshi_kanade you always help people out :)
There are many tricky cases in this problem. For example, try the following out...
7 7 4 4 6 4 7 4 8 4 9
Answer in this case is 3 3.
Another one...
10 15 3 10 15 10 15 10 15.
Here, the answer is 3 3 too.