- C23panweiming's blog
- 2024.1.27-2027.1.28
- @ 2024-1-28 17:09:06
学了贪心,归并
学了动态规划,分治
- 贪心是在局部中找到最优解
- 动态规划就是记忆化搜索,基于贪心,但不同的是,动态规划是找全局最优解
- 分治是分开再分开,再求解
- 归并排序基于分治,是O(n log_2 n)的算法,分开到底后再合
 C23panweiming
      
                      LV 7
                    
            @
            2024-1-28 17:09:06
    
          C23panweiming
      
                      LV 7
                    
            @
            2024-1-28 17:09:06
          学了贪心,归并
学了动态规划,分治
By signing up a ZXOJ universal account, you can submit code and join discussions in all online judging services provided by us.