| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
Hello folks!!
I want to understand how to approach the problems where we have to do some sort of operations on array. For example swap some elements such that array becomes increasing . Something like this . I find it difficult that how to pick the operations and perform them optimally. I would be highly obliged for valuable tips and suggestions .
Regards
Mostly these type of problem have some observation which can be caught by writing some test cases and concluding some key takeaways and some reasoning etc and also using pen and paper while solving this kind of questions helps
What you're asking is unbelievably broad, and one can't possibly help you with that. CP isn't like school where you memorize how to approach each type of problem and just copy that approach on a test. You need to think on a problem by problem basis.
For the specific problem you're talking about, there is an explanation of it on the Competitive Programmer Handbook inversion section.