{"push_id":748355794,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"cc2f4057d2537eee88e6d4bcb724c35ca6f1de76","before":"90b3df7db9829b4e0908bf8ad62d68561501f5d9","commits":[{"sha":"cc2f4057d2537eee88e6d4bcb724c35ca6f1de76","author":{"email":"f08c277fb80a363dfa2384679e3ccd5cee436adf@gmail.com","name":"xuziye0327"},"message":"hdu 1160 Accepted\n\nDP。\n找出最多的老鼠, 排序后满足 (W[i] < W[i + 1]) && (S[i] > S[i + 1])。\n初始化 dp[i] = 1。 因为最少可以选 1 只。 如果 m[i] 和 m[i + 1] 满足条件, 则 dp[i] = dp[i +\n1]。","distinct":true,"url":"https://api.github.com/repos/xuziye0327/hdu/commits/cc2f4057d2537eee88e6d4bcb724c35ca6f1de76"}]}