• <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>
            #include? < stdio.h >
            #include?
            < limits.h >
            #include?
            < stdlib.h >
            #include?
            < math.h >
            #include?
            < string .h >

            #define ?N?110

            int ?graph[N][N];
            int ?rank[N];
            int ?value[N];
            int ?m,?n,?len;

            bool ??findrank(? int ?t?)
            {
            ????
            for (? int ?i = ? 0 ;?i < ?t;? ++ i?)
            ????
            if (?value[i] == ?t?)? return ? true ;
            ????
            ????
            return ? false ;
            }


            int ?dis(? int ?Rank?)
            {
            ????
            bool ?visite[N];
            ????
            int ??result[N];
            ????rank[
            0 ] = ?Rank;
            ????
            ????
            for (? int ?i = ? 1 ;?i <= ?n;? ++ i?)?
            ????
            {
            ????????
            int ?t = ?Rank - ?rank[i];
            ????????
            ????????
            if (?t <= ?m? && ?t >= ? 0 ?)? {?visite[i] = ? false ;??result[i] = ?graph[ 0 ][i];?}
            ????????
            else ????????????????? {?visite[i] = ? true ;???result[i] = ? - 1 ;?}
            ????}

            ????
            ????visite[
            0 ] = ? true ;
            ????
            for (? int ?t = ? 1 ;?t <= ?n;? ++ t?)
            ????
            {
            ????????
            int ??min = ?INT_MAX;
            ????????
            int ??k = ? - 1 ;
            ????????
            ????????
            for (? int ?i = ? 0 ;?i <= ?n;? ++ i?)
            ????????
            if (? ! visite[i]? && ?result[i] >= ? 0 ? && ?result[i] < ?min??)
            ????????
            {
            ????????????min
            = ?result[i];
            ????????????k
            = ?i;
            ????????}

            ????????
            if (?k == ? - 1 ?)? break ;
            ????????
            ????????visite[k]
            = ? true ;
            ????????
            for (? int ?i = ? 1 ;?i <= ?n;? ++ i?)
            ????????
            {
            ????????????
            if (? ! visite[i]? && ??graph[k][i] >= ? 0 ? && ?result[k] >= ? 0 ?
            ????????????????????????
            && ?(?result[k] + ?graph[k][i] < ?result[i]? || ?result[i] == ? - 1 ?)?)
            ????????????result[i]
            = ?result[k] + ?graph[k][i];
            ????????}
            ?
            ????}

            ?
            ????
            return ?result[ 1 ];
            }


            int ?main()
            {
            ????scanf(
            " %d%d " ,? & m,? & n);
            ????len
            = ? 0 ;
            ????
            ????memset(?graph,?
            - 1 ,? sizeof ( int ) * N * N?);
            ????
            ????
            for (? int ?i = ? 1 ;?i <= ?n;? ++ i?)
            ????
            {
            ????????
            int ?va,?ra,?nn;
            ????????
            ????????scanf(
            " %d%d%d " ,? & va,? & ra,? & nn?);
            ????????graph[
            0 ][i] = ?va;
            ????????rank[i]
            = ?ra;
            ????????
            ????????
            if (? ! findrank(?ra?)?)?value[len ++ ] = ?ra;
            ????????
            ????????
            for (? int ?j = ? 0 ;?j < ?nn;? ++ j?)
            ????????
            {
            ????????????
            int ?a,?b;
            ????????????scanf(
            " %d%d " ,? & a,? & b);
            ????????????
            ????????????graph[a][i]
            = ?b;
            ????????}

            ????}
            ????
            ????
            ????
            int ?min = ?INT_MAX;
            ????
            for (? int ?i = ? 0 ;?i < ?len;? ++ i?)
            ????????
            {????????
            ????????????
            int ?t = ?dis(?value[i]?);
            ????????????
            ????????????
            if (?t < ?min? && ?t != ? - 1 ?)?min = ?t;
            ????????}

            ????????
            ????printf(
            " %d\n " ,?min?);
            ????
            ????
            return ? 0 ;
            }

            posted on 2008-10-29 21:01 Darren 閱讀(346) 評(píng)論(0)  編輯 收藏 引用 所屬分類: 圖論
            久久国产三级无码一区二区| 午夜精品久久久久久久无码| 亚洲国产另类久久久精品 | 亚洲AV乱码久久精品蜜桃| 久久亚洲AV成人无码| 久久精品aⅴ无码中文字字幕不卡| 韩国免费A级毛片久久| 久久国产精品国语对白| 久久久久亚洲AV片无码下载蜜桃| 97超级碰碰碰久久久久| 欧美麻豆久久久久久中文| 久久精品国产清高在天天线| 国产精品成人99久久久久91gav| 精品伊人久久久| 亚洲国产成人久久精品影视| 久久婷婷色香五月综合激情| 国产69精品久久久久777| 久久综合久久综合亚洲| 久久综合中文字幕| 亚洲va久久久噜噜噜久久| 久久久精品国产亚洲成人满18免费网站| 狠狠色婷婷久久一区二区| 久久精品国产72国产精福利| 久久婷婷国产综合精品| 久久精品视频一| 一本色道久久综合狠狠躁篇| 国产亚洲成人久久| 久久精品国产99国产电影网| 亚洲精品国产美女久久久| 一级A毛片免费观看久久精品| 91精品久久久久久无码| 久久精品国产一区| 国产精品久久久久久| 欧美噜噜久久久XXX| 亚洲AV成人无码久久精品老人 | 午夜视频久久久久一区 | 久久久这里有精品| 久久天天躁狠狠躁夜夜2020老熟妇| www.久久99| 中文字幕亚洲综合久久| 国产AⅤ精品一区二区三区久久|