#include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;
int N,K;
const int MAX = 100005;
int dp[MAX];

int main(){
	cin>>N>>K;
	for(int i = 0;i <= K;i++){
		dp[i] = abs((int)(N - i));
	}
	for(int i = N+1;i <= K;i++){
		if(i & 1) // 奇数
		{
			dp[i] = min(dp[i],dp[(i-1)/2]+2);
			dp[i] = min(dp[i],dp[i-1]+1);
			dp[i] = min(dp[i],dp[(i+1)/2]+2);
		} 
		else{
			dp[i] = min(dp[i],dp[i/2]+1);
			dp[i] = min(dp[i],dp[i-1]+1);
			dp[i] = min(dp[i],dp[i/2 + 1]+2);
		}
	}
	cout<<dp[K]<<endl;
	return 0;
} 

• Re:这道题明显的动态规划啊啊啊啊啊 (614) 1803146326 2019-08-29 10:34:24
• Re:这道题明显的动态规划啊啊啊啊啊 (614) 1803146326 2019-08-29 10:35:55
• 奇偶分别两个判断的dp (1022) 1803146326 2019-08-29 10:37:45