Codeforces Round #389 (Div. 2) E. Santa Claus and Tangerines 二分+贪心+记忆化搜索

E. Santa Claus and Tangerines 二分+贪心+记忆化搜索 My Solution 题意:有n个橘子,每个橘子可以…

  • ACM-ICPC题解二分法
  • 2017/11/9
  • 138
  • Topcoder SRM 413 (Div 2) 1000.InfiniteSequence

    1000.InfiniteSequence My Solution Just memory search // BEGIN CUT HERE // END CUT HERE #lin…

  • ACM-ICPC题解dfs/bfs
  • 2017/11/3
  • 183
  • 2016 UESTC Training for Dynamic Programming D – 柱爷的恋爱 区间dp、记忆化搜索

    D - 柱爷的恋爱 区间dp、记忆化搜索 Source 2016 UESTC Training for Dynamic Programming M…

  • ACM-ICPC题解dp
  • 2016/5/17
  • 136