• <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 - 74,  comments - 33,  trackbacks - 0
            Perfect Service
            Time Limit: 2000MS Memory Limit: 65536K
            Total Submissions: 661 Accepted: 319

            Description

            A network is composed of N computers connected by N ? 1 communication links such that any two computers can be communicated via a unique route. Two computers are said to be adjacent if there is a communication link between them. The neighbors of a computer is the set of computers which are adjacent to it. In order to quickly access and retrieve large amounts of information, we need to select some computers acting as servers to provide resources to their neighbors. Note that a server can serve all its neighbors. A set of servers in the network forms a perfect service if every client (non-server) is served by exactly one server. The problem is to find a minimum number of servers which forms a perfect service, and we call this number perfect service number.

            We assume that N (≤ 10000) is a positive integer and these N computers are numbered from 1 to N. For example, Figure 1 illustrates a network comprised of six computers, where black nodes represent servers and white nodes represent clients. In Figure 1(a), servers 3 and 5 do not form a perfect service because client 4 is adjacent to both servers 3 and 5 and thus it is served by two servers which contradicts the assumption. Conversely, servers 3 and 4 form a perfect service as shown in Figure 1(b). This set also has the minimum cardinality. Therefore, the perfect service number of this example equals two.

            Your task is to write a program to compute the perfect service number.

            Input

            The input consists of a number of test cases. The format of each test case is as follows: The first line contains one positive integer, N, which represents the number of computers in the network. The next N ? 1 lines contain all of the communication links and one line for each link. Each line is represented by two positive integers separated by a single space. Finally, a 0 at the (N + 1)th line indicates the end of the first test case.

            The next test case starts after the previous ending symbol 0. A ?1 indicates the end of the whole inputs.

            Output

            The output contains one line for each test case. Each line contains a positive integer, which is
            the perfect service number.

            Sample Input

            6
            1 3
            2 3
            3 4
            4 5
            4 6
            0
            2
            1 2
            -1

            Sample Output

            2
            1
            樹的最小支配集:和3659一樣。TreeDP求解:
            代碼同上篇隨筆一樣:
            posted on 2009-04-09 22:58 KNIGHT 閱讀(119) 評論(0)  編輯 收藏 引用
            <2025年6月>
            25262728293031
            1234567
            891011121314
            15161718192021
            22232425262728
            293012345

            常用鏈接

            留言簿(8)

            隨筆檔案

            文章檔案

            Friends

            OJ

            搜索

            •  

            最新評論

            閱讀排行榜

            評論排行榜

            波多野结衣AV无码久久一区| 无码任你躁久久久久久| 久久久久亚洲AV无码永不| 久久精品国产亚洲AV影院| 人妻精品久久无码区| 97久久精品无码一区二区天美| 国产精品久久波多野结衣| 日韩中文久久| 99久久99久久久精品齐齐| 亚洲精品成人久久久| 成人国内精品久久久久影院| 日本久久久久久久久久| 精品久久久久久| 久久久久久久女国产乱让韩| 国产叼嘿久久精品久久| 色欲av伊人久久大香线蕉影院 | 久久久久亚洲国产| 精品综合久久久久久97超人 | 久久久免费观成人影院| 久久中文骚妇内射| 久久久久亚洲AV成人网人人网站| 久久国产视屏| 国产成人综合久久久久久| MM131亚洲国产美女久久| 日韩久久久久久中文人妻| 久久频这里精品99香蕉久| 久久久久亚洲av成人无码电影 | 久久久精品国产亚洲成人满18免费网站 | 国产精品久久久久久久久软件| 免费观看久久精彩视频 | 久久久久国产一级毛片高清板| 国产精品久久久福利| 久久精品中文字幕无码绿巨人| 一本久久知道综合久久| 囯产精品久久久久久久久蜜桃| 日本精品一区二区久久久| 亚洲一区精品伊人久久伊人| 久久天天躁狠狠躁夜夜av浪潮| 久久这里只有精品视频99| 久久久久国产一区二区| 久久综合亚洲鲁鲁五月天|