[USACO17FEB]Why Did the Cow Cross the Road II P 树状数组·特殊的Dp更新方式 题解: 类似最长公共子序列的方程: f[i][j]=max(f[i−1][j],f[i][j−1