USACO 2018 OPEN

G1 Out of Sorts
有一个更优秀的O(n log n)做法,不需要用树状数组

G2
二分,拓扑排序

G3 Talent Show
唯一正确的做法就是01分数规划
dp[total talent] = min(total weight)
是错误的,不一定total weight最小,就是最好的。

Leave a Reply

Your email address will not be published. Required fields are marked *