随笔分类 -  ACM_usaco

usaco 4.3 Buy Low, Buy Lower
摘要：http://train.usaco.org/usacoprob2?a=7BaJNgFLmpD&S=buylow 求最长递减子序列以及方案数，注意重复不算，比如 3 2 3 2 1 ，这里取到最长递减子序列算一种(3 2 1)。 思路： 最长递减子序列的长度可以直接dp： dp[i]=max(dp[ 阅读全文
posted @ 2016-02-16 11:11 __560 阅读(270) 评论(0) 推荐(0)
usaco 3.2 Stringsobits 数位dp
摘要：StringsobitsKim Schrijvers Consider an ordered set S of strings of N (1 <= N <= 31) bits. Bits, of course, are either 0 or 1. This set of strings is i 阅读全文
posted @ 2016-02-12 08:20 __560 阅读(268) 评论(0) 推荐(0)