This question is tagged with dp, therefore I thought this could be solved with dp, I Tried but couldn't find the transition states.can anyone help ?? please.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
This question is tagged with dp, therefore I thought this could be solved with dp, I Tried but couldn't find the transition states.can anyone help ?? please.
Название |
---|
My submission
Let
cnt[i]
be the count of indices wherea[j] < j
for all $$$1\leq j \leq i$$$. The transition would becnt[i] = cnt[i-1] + (1 if a[i] < i)
. The final answer would then be $$$\sum_{i=1}^{n} \text{cnt}[a[i]-1]$$$.thanks