How can I attack problems like,"minimum number of operations to sort an array or permutation", Can anyone give me some lists of problems?
№ | Пользователь | Рейтинг |
---|---|---|
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 | 166 |
2 | maomao90 | 163 |
2 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | adamant | 160 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | nor | 153 |
9 | Dominater069 | 153 |
How can I attack problems like,"minimum number of operations to sort an array or permutation", Can anyone give me some lists of problems?
Название |
---|
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