URAL 1223. Chernobyl’ Eagle on a Roof

题目链接

以前做过的一题，URAL数据强点，优化了一下。

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <queue>
 #include <map>
 #include <ctime>
 #include <cmath>
 #include <algorithm>
 using namespace std;
 int dp[][];
 int dfs(int n,int m)
 {
     int i,temp,ans;
     if(dp[n][m] > )
     return dp[n][m];
     if(m == )
     return n;
     if(n <= )
     return n;
     ans = ;
     for(i = ;i <= n-;i ++)
     {
         temp = max(dfs(i-,m)+,dfs(n-i,m-)+);
         ans = min(temp,ans);
     }
     dp[n][m] = ans;
     return dp[n][m];
 }
 int main()
 {
     int n,m;
     while(scanf("%d%d",&n,&m)!=EOF)
     {
         if(n == &&m == ) break;
         if(n > ) n = ;
         printf("%d\n",dfs(m,n));
     }
     return ;
 }