BZOJ1962 模型王子

戳这里

/**************************************************************
    Problem: 1962
    User: rausen
    Language: C++
    Result: Accepted
    Time:0 ms
    Memory:41824 kb
****************************************************************/
 
#include <cstdio>
#include <algorithm>
 
using namespace std;
const int N = 1e5 + 5;
const int K = 105;
 
int n, k;
int f[N][K];
 
int main() {
    int i, j;
    scanf("%d%d", &n, &k);  
    for (i = 2; ; ++i) {
        for (f[i][1] = i >> 1, j = 2; j <= k; ++j)
            f[i][j] = max(f[i - 1][j] + f[i - 2][j - 2], f[i - 2][j] + f[i - 1][j - 1]) + 1;
        if (f[i][k] >= n) {
            printf("%d
", i);
            return 0;
        }
    }
    return 0;
}