How can I attack problems like,"minimum number of operations to sort an array or permutation", Can anyone give me some lists of problems?
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
How can I attack problems like,"minimum number of operations to sort an array or permutation", Can anyone give me some lists of problems?
| Name |
|---|



just fucking practice random problems
Solving random problems is not so efficient imo.
Solving a batch of problems on the same topic (and finding common ideas / techniques) may be much more insightful than solving those problems several weeks / months apart. In the latter case, it's more frequent to end up not solving a problem, reading the editorial and realizing that the you'd encountered the necessary idea a lot of times before, but you didn't remember it.
I'm interested in other opinions, though. How do you usually practice and is it effective?
I mean I think it's useful to solve a lots of dp problems or graph problems specifically sometimes.But should things be that specific like — "Minimum number of operations to sort an array type problems"??
It's still better than solving random problems. I also think that topic is not too specific (there are a lot of problems like that).
https://atcoder.jp/contests/arc132/editorial/3200