• <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)論排行榜

            久久久精品人妻一区二区三区四| 国产99久久久国产精免费| 色妞色综合久久夜夜| 久久久久久久久波多野高潮| 国产亚洲精品自在久久| 中文字幕成人精品久久不卡| 亚洲午夜久久久| 狠狠色婷婷综合天天久久丁香| 66精品综合久久久久久久| 久久久久久精品成人免费图片 | 99久久无色码中文字幕| 国产精品女同一区二区久久| 怡红院日本一道日本久久 | 久久男人Av资源网站无码软件| 99久久婷婷国产一区二区| 亚洲精品乱码久久久久久蜜桃不卡| 精品午夜久久福利大片| 久久精品免费一区二区| 久久996热精品xxxx| 色综合久久88色综合天天| 18岁日韩内射颜射午夜久久成人| 久久久精品国产Sm最大网站| 久久99国产精品久久99果冻传媒| 久久亚洲AV无码精品色午夜| 久久国产成人| 久久综合狠狠综合久久激情 | 久久夜色精品国产| 99久久精品国产毛片| 精品免费tv久久久久久久| 久久婷婷国产综合精品| 欧美丰满熟妇BBB久久久| 波多野结衣久久一区二区| 尹人香蕉久久99天天拍| 日本国产精品久久| 久久综合五月丁香久久激情| 99久久国产热无码精品免费久久久久 | 精品久久人人妻人人做精品| 久久精品国产只有精品2020| 中文字幕亚洲综合久久| 99久久综合国产精品二区| 久久久精品国产亚洲成人满18免费网站|