Hello guys. I have struggle with IOI 2016 problem B. How it can be solved for 100 points. Please in explanation clarify why we did that step?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | SecondThread | 145 |
9 | pajenegod | 145 |
I have problem.
Given array.
You have Q queries.
You need to find most frequent number between l and r. n, Q <= 500 000.
I have interesting problem from WCIP3G. I thought that is DP.
And in my DP I have 2 states.
dp[i][j] = answer for subsequence from i to j
.
Transitions obviously will be dp[i + 1][j] and dp[i][j - 1].
But how it can be written?
Название |
---|