Hi.
Here is the link to the editorial. Feel free to discuss problems here and ask me questions.
→ Обратите внимание
До соревнования
Codeforces Round 1097 (Div. 1, Based on Zhili Cup 2026)
36:01:18
Зарегистрироваться »
Codeforces Round 1097 (Div. 1, Based on Zhili Cup 2026)
36:01:18
Зарегистрироваться »
*есть доп. регистрация
До соревнования
Codeforces Round 1097 (Div. 2, Based on Zhili Cup 2026)
36:01:18
Зарегистрироваться »
Codeforces Round 1097 (Div. 2, Based on Zhili Cup 2026)
36:01:18
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | adamant | 152 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 144 |
| 5 | errorgorn | 141 |
| 6 | cry | 139 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 04.05.2026 21:03:44 (g2).
Десктопная версия, переключиться на мобильную.
При поддержке
Change it to read-only access
I'll complete that sentence: Change it to read-only access or you'll end up like Mountain Dew during their Dub the Dew campaign.
in ArraySorting we have to find longest non-decreasing Sequence instead LIS and change other elements.right?
Yes.
Can anybody please explain the solution to the problem "Array Sorting". As i am not good with dp, i am not able to understand the editorialist's approach.
Do you know how to find Longest Increasing Subsequence?
Yes, i know that much.
The answer is n — size of LIS.
Does that mean i just have to set the values of the other elements which are not in the LIS to the minimum possible?
Yes.