计蒜客之动态规划篇(1)

1. 爬楼梯ios //用组合数的方法比较拖沓 #include <iostream> using namespace std; const int N = 55; int n; unsigned dp[N]; //dp[i]:从阶梯0跳到n的方法数, 爆int void solve() { dp[1] = dp[0] = 1; for (int i = 2; i <= n;

>>阅读原文<<