I noticed that some of the accepted codes for this problem are incorrect. You can take any accepted code and test with the case: t=1, n=6, a[i]:{8, 1, 3, 4, 6, 8}. When running manually, the result should be 38, but some codes still get accepted even though they are wrong. I’ve tested a few codes, and their results were 46, 246, and so on.
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | jiangly | 3898 |
| 2 | tourist | 3840 |
| 3 | orzdevinwang | 3706 |
| 4 | ksun48 | 3691 |
| 5 | jqdai0815 | 3682 |
| 6 | ecnerwala | 3525 |
| 7 | gamegame | 3477 |
| 8 | Benq | 3468 |
| 9 | Ormlis | 3381 |
| 10 | maroonrk | 3379 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | -is-this-fft- | 165 |
| 3 | Dominater069 | 160 |
| 4 | atcoder_official | 159 |
| 4 | Um_nik | 159 |
| 6 | djm03178 | 156 |
| 7 | adamant | 153 |
| 8 | luogu_official | 149 |
| 8 | awoo | 149 |
| 10 | TheScrasse | 146 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2025 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 08.02.2025 13:11:33 (j1).
Десктопная версия, переключиться на мобильную.
При поддержке
hi for notice in constraints of the problem for all $$$1 \leq i \leq n$$$ its guaranteed $$$1 \leq a_i \leq n$$$, in your example $$$a_1 = 8, a_1 > 6$$$ (1 based indexing)