Catch That Cow
来源:互联网 发布:js onload是什么事件 编辑:程序博客网 时间:2024/06/16 08:20
人在n处,牛在k处,人一次可以到加一,减一,或乘以2的位置上,求到牛的最短时间。感觉用了dp做,和搜索的思想类似吧,每次进队列,然后搜索+1,-1,乘2的位置,然后反复,一直到k处,跳出循环,注意每次判断要加上限定,不然会越界。
#include<cstdio>#include<cstring>#include<iostream>#include<queue>using namespace std;int dp[100005], leap[100005];queue<int>p;int main(){int i, j, m, n, ans, k,temp;cin >> temp >> k;memset(leap, 0, sizeof(leap));dp[k] = -1; dp[temp] = 0; leap[temp] = 1;p.push(temp);while (p.size()){n = p.front();if (!leap[n + 1]&&n+1<=100000&&n+1>=0){leap[n + 1] = 1;dp[n + 1] = dp[n] + 1;p.push(n + 1);}if (!leap[n - 1]&&n-1>=0&&n-1<=100000){leap[n - 1] = 1;dp[n - 1] = dp[n] + 1;p.push(n - 1);}if (n * 2 <= 100000&&n*2>=0){if (!leap[2 * n]){leap[2 * n] = 1;dp[2 * n] = dp[n] + 1;p.push(2 * n);}}p.pop();if (dp[k] != -1)break;}cout << dp[k] << endl;return 0;}
0 0
- POJ3278 Catch That Cow
- Catch That Cow
- Catch That Cow
- poj3278 Catch That Cow
- 3278. Catch That Cow
- 【HDU2717】-Catch that cow
- Catch That Cow
- F - Catch That Cow
- poj3278 - Catch That Cow
- HDOJ Catch That Cow
- 2717Catch That Cow
- POJ3278 Catch That Cow
- 3278Catch That Cow
- Catch That Cow(bfs)
- Catch that cow (H2717)
- POJ3278--Catch That Cow
- Catch That Cow
- Catch That Cow+BFS
- POST对URL中末尾斜杠的差异
- 推荐系统评测标准TOPN之precision与recall
- Java并发编程-22-处理在执行器中被拒绝的任务
- 正则常用
- IOS开发--iOS核心动画
- Catch That Cow
- 利用Dumpsys做系统诊断
- 黑马程序员------java语言基础
- C primer plus(第五版)编程练习第十五章
- 每天一个linux命令(50):crontab命令
- uva 122
- LeetCode—Remove Linked List Elements—C++
- php的事件处理机制(回调函数)
- conn 配置