ACM中的许多问题都是已有良好结论和算法的题目,如果不知道这些题目,临战而思,时间是多半不够,所以对这些经典问题的解读要十分熟悉。
子段、子序列问题:
longest common sequence(LCS)
longest increase sequence(LIS)
longest common increase sequence(LCIS)
maximum subarray problem(最大子段和问题)
动态规划:
matrix chain multiplication(矩阵最优乘法问题)
polygon partition problem(多边形最优剖分)
区间查询问题:
rang minimum/maximum query(RMQ)
博弈:
Bash Game
Nim Game
Wythoff Game
图论:
minimum span tree(MST)
lowest common ancester(LCA)
shortest path
critical path
Euler path
Hamilton path