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 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 157 |
6 | Qingyu | 156 |
7 | adamant | 151 |
7 | djm03178 | 151 |
7 | luogu_official | 151 |
10 | awoo | 146 |
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