Seeking41900's blog

Need Help For Training

By Seeking41900, history, 4 years ago, In English

What are the topics should I learn before 1600 (Expert)? if you can share some tips to help me in my training tell me, please thanks for your response

  • Vote: I like it
  • +8
  • Vote: I do not like it

»
4 years ago, # |
  Vote: I like it -12 Vote: I do not like it

FFT

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it +9 Vote: I do not like it

    I think fft would bring you into at least 2200, possibly red.

    → Reply
»
4 years ago, # |
  Vote: I like it +12 Vote: I do not like it

Greedy, dp, bfs and dfs, binary search, some knowledge about binary, fast solving and some implementation are the only things you need to do.

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Can u pls explain What is binary,fast solving ?

    → Reply
    • »
      »
      »
      4 years ago, # ^ |
        Vote: I like it +1 Vote: I do not like it

      The binary is expressing numbers by 0 and 1, there are lots of operation on it. Fast solving is just solving problems fast.

      → Reply
      • »
        »
        »
        »
        4 years ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        Oh I thought they are combined terms. Thanks

        → Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    thank u so much :D

    → Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    Please also tell me topics required for CM?

    → Reply
»
4 years ago, # |
  Vote: I like it +1 Vote: I do not like it

https://cp-algorithms.com/ This page is really good to learn algorithms There are most topics with applications and problems.

→ Reply
»
4 years ago, # |
  Vote: I like it +2 Vote: I do not like it

expert = implementation fast, candidate master = expert + dp, graphs, combinatoric,

→ Reply
»
4 years ago, # |
  Vote: I like it +2 Vote: I do not like it

I think Practicing DP/Greedy/DFS/BFS/Binary search/MST/String based questions. and fast solving will be sufficient for becoming expert.

→ Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

There is nice website CSES. On this website collected a lot of classical problems.

I think there are no topics for concrete learning. You need to solve many problems and get more experience. Solve dynamic programming, greedy, realization, binary search, graphs problems.

For example, you need to have intuition where you should use dp[i] = ans for prefix i or dp[l][r] = ans for subsegment [l..r].

Also, solve math problems to get useful ideas.

→ Reply