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 + ;
 const int K = ;

 int n, k;
 int f[N][K];

 int main() {
     int i, j;
     scanf("%d%d", &n, &k);
     for (i = ; ; ++i) {
         for (f[i][] = i >> , j = ; j <= k; ++j)
             f[i][j] = max(f[i - ][j] + f[i - ][j - ], f[i - ][j] + f[i - ][j - ]) + ;
         if (f[i][k] >= n) {
             printf("%d\n", i);
             return ;
         }
     }
     return ;
 }