What happened to zh0ukangyang ??
Did this account get deleted as he had one more in top 10 ?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3821 |
3 | Benq | 3736 |
4 | Radewoosh | 3631 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3388 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
What happened to zh0ukangyang ??
Did this account get deleted as he had one more in top 10 ?
I'll keep it short.
Bob has an element x and Alice has a permutation p of size n.
Alice goes through the permutation sequentially and asks Bob what is the relation between x and p[i] .
if p[i] < x + 0.5 Bob replies '<' otherwise Bob replies '>'.
Ex: x = 2 and p = [1,3,2] gives us a string "<><" .
Now Alice is smart and does not ask unnecessary questions.
Ex: x = 2 and p = [3,4,1,2] will gives us a string "><<"
Here Alice ignores the 2nd element because in first question she determined that 3 > x+0.5 so of course 4 is also going to be greater than x+0.5 .
Let c be the number of times "><" occurs as a substring in our resultant string. Find all c for x in range 0 to n.
input:
6
5 1 2 4 3 6
output:
0 1 1 2 1 0 0
I did a brute force O(n^2) solution using stack but as expected got TLE in some tc's as n<=2*1e5. Can someone please guide me towards an efficient solution
Name |
---|