摘要:
Problem A Problem B Problem C Problem D Problem E Problem F Problem G Problem H Problem I Problem J Problem K Problem L 阅读全文
摘要:
Problem A Problem B Problem C Problem D Problem E Problem F Problem G Problem H Problem I Problem J Problem K Problem L 阅读全文
摘要:
Problem A Problem B Problem C Problem D 首先对每个点排序,相当于从左边开始扫过来。 把一条线段看成两个点,离散化之后是$cnt$个点,转化成覆盖$cnt$个点的最少花费。 设$f[i][j]$表示覆盖编号$i$到$j$的点的必须的最小花费。 转移的时候在当前区 阅读全文
摘要:
Problem A Problem B Problem C Problem D Problem E Problem F Problem G Problem H Problem I Problem J Problem K Problem L 阅读全文