• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>
            posts - 3,  comments - 1,  trackbacks - 0
            學(xué)會(huì)了隊(duì)列.這道題的主要思想:

            5先入列   把5出列  5 可以變成 4 ,6 , 10, ,把得到的數(shù)入列,然后再出列分別處理..如果前面出現(xiàn)過就不入列..定義一個(gè)計(jì)數(shù)數(shù)組,然后number[y - 1] = number[y] + 1;  number[y + 1] = number[y] + 1; number[y * 2] = number[y] + 1;

            Catch That Cow
            Time Limit: 2000MS Memory Limit: 65536K
            Total Submissions: 8341 Accepted: 2476

            Description

            Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number line and the cow is at a point K (0 ≤ K ≤ 100,000) on the same number line. Farmer John has two modes of transportation: walking and teleporting.

            * Walking: FJ can move from any point X to the points X - 1 or X + 1 in a single minute
            * Teleporting: FJ can move from any point X to the point 2 × X in a single minute.

            If the cow, unaware of its pursuit, does not move at all, how long does it take for Farmer John to retrieve it?

            Input

            Line 1: Two space-separated integers: N and K

            Output

            Line 1: The least amount of time, in minutes, it takes for Farmer John to catch the fugitive cow.

            Sample Input

            5 17

            Sample Output

            4

            Hint

            The fastest way for Farmer John to reach the fugitive cow is to move along the following path: 5-10-9-18-17, which takes 4 minutes.




            Source Code

            Problem: 3278 User: luoguangyao
            Memory: 1048K Time: 110MS
            Language: C++ Result: Accepted
            • Source Code
              #include <iostream>
                  #include <queue>
                  using namespace::std;
                  int number[100001] = {0};
                  bool num[100001] = {0};
                  int main()
                  {
                  queue<int> x;
                  int a;
                  int b;
                  scanf("%d%d",&a,&b);
                  int count = 0;
                  number[a] = 0;
                  x.push(a);
                  while (x.size())
                  {
                  int y = x.front();
                  x.pop();
                  num[y] = 1;
                  if (y == b)
                  {
                  break;
                  }
                  else
                  {
                  if (y - 1 >= 0)
                  {
                  if (!num[y - 1])
                  {
                  x.push(y - 1);
                  number[y - 1] = number[y] + 1;
                  num[y - 1] = 1;
                  }
                  }
                  if (y + 1 <= 100000)
                  {
                  if (!num[y + 1])
                  {
                  x.push(y + 1);
                  number[y + 1] = number[y] + 1;
                  num[y + 1] = 1;
                  }
                  }
                  if (y * 2 <= 100000)
                  {
                  if (!num[y * 2])
                  {
                  x.push(y * 2);
                  number[y * 2] = number[y] + 1;
                  num[y * 2] = 1;
                  }
                  }
                  }
                  }
                  cout << number[b] << endl;
                  return 0;
                  }
            posted on 2009-03-07 18:33 生活要低調(diào) 閱讀(1809) 評(píng)論(0)  編輯 收藏 引用

            只有注冊(cè)用戶登錄后才能發(fā)表評(píng)論。
            網(wǎng)站導(dǎo)航: 博客園   IT新聞   BlogJava   博問   Chat2DB   管理


            <2025年7月>
            293012345
            6789101112
            13141516171819
            20212223242526
            272829303112
            3456789

            常用鏈接

            留言簿(1)

            隨筆檔案

            搜索

            •  

            最新評(píng)論

            閱讀排行榜

            評(píng)論排行榜

            三级韩国一区久久二区综合| 26uuu久久五月天| 亚洲七七久久精品中文国产| 久久免费99精品国产自在现线 | 久久人人超碰精品CAOPOREN| 久久久久亚洲AV无码专区网站| 国产精品一区二区久久精品涩爱| 99久久国产亚洲综合精品| 亚洲第一极品精品无码久久| 久久精品无码午夜福利理论片| 亚洲成色999久久网站| 亚洲美日韩Av中文字幕无码久久久妻妇| 久久婷婷色香五月综合激情| 国产精品无码久久综合| 久久综合成人网| 精品久久久久久久久中文字幕| 久久亚洲国产成人影院网站| 久久精品国产亚洲av日韩| 精品国产综合区久久久久久| 欧美va久久久噜噜噜久久| 久久精品国产一区二区三区| 久久精品国产亚洲AV高清热| 久久精品国产亚洲AV蜜臀色欲| 久久精品国产99国产电影网| 97精品依人久久久大香线蕉97| 99久久精品国产毛片| aaa级精品久久久国产片| 久久精品国产精品亚洲精品| 久久久久久一区国产精品| 国产成人精品久久一区二区三区| 久久国产色av免费看| 人妻系列无码专区久久五月天| 狠狠色丁香久久婷婷综| 久久久亚洲欧洲日产国码二区 | 一本一道久久综合狠狠老 | 国内精品久久久久| 久久久久国产精品| 亚洲一本综合久久| 久久国产精品视频| 久久国产成人午夜AV影院| 亚洲午夜福利精品久久|