• <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 - 195,  comments - 30,  trackbacks - 0

             

            #include<iostream>
            #include
            <cstdlib>
            #include 
            <memory> 
            using namespace std;
              
            int a[201];
              
            int main()
              
            {
              
            //freopen("s.txt","r",stdin);
              
            //freopen("key.txt","w",stdout);
              int n,m,i,j,k,temp;
              cin
            >>n;
              
            while(n--)
              
            {
                 temp
            =0;       
                 memset(a,
            0,sizeof(a));              
                 cin
            >>m;
                 
            while(m--)
                 
            {
                        cin
            >>i>>j;
                        
            if(i%2==0)
                          i
            =i/2;
                          
            else i=i/2+1;
                        
            if(j%2==0)
                           j
            =j/2;
                           
            else 
                             j
            =j/2+1;
                        
            if(i>j)
                        
            {temp=i;
                        i
            =j;
                        j
            =temp;
                        temp
            =0;
                        }
                 
                        
            for(k=i;k<=j;k++)
                        a[k]
            ++;  
                 }

                 
            for(k=1;k<=200;k++)
                 
            if(a[k]>temp)temp=a[k];
                 cout
            <<temp*10<<endl;                 
              }


              
            //system("PAUSE");
              return   0;
              }

            Moving Tables


            Status In/Out TIME Limit MEMORY Limit Submit Times Solved Users JUDGE TYPE
            stdin/stdout 3s 8192K 899 213 Standard

            The famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure.

            The floor has 200 rooms each on the north side and south side along the corridor. Recently the Company made a plan to reform its system. The reform includes moving a lot of tables between rooms. Because the corridor is narrow and all the tables are big, only one table can pass through the corridor. Some plan is needed to make the moving efficient. The manager figured out the following plan: Moving a table from a room to another room can be done within 10 minutes. When moving a table from room i to room j, the part of the corridor between the front of room i and the front of room j is used. So, during each 10 minutes, several moving between two rooms not sharing the same part of the corridor will be done simultaneously. To make it clear the manager illustrated the possible cases and impossible cases of simultaneous moving.


            For each room, at most one table will be either moved in or moved out. Now, the manager seeks out a method to minimize the time to move all the tables. Your job is to write a program to solve the manager’s problem.

            Input

            The input consists of T test cases. The number of test cases ) (T is given in the first line of the input file. Each test case begins with a line containing an integer N , 1<=N<=200 , that represents the number of tables to move. Each of the following N lines contains two positive integers s and t, representing that a table is to move from room number s to room number t (each room number appears at most once in the N lines). From the N+3-rd line, the remaining test cases are listed in the same manner as above.

             

            Output

            The output should contain the minimum time in minutes to complete the moving, one per line.

            Sample Input

            3
            4
            10 20
            30 40
            50 60
            70 80
            2
            1 3
            2 200
            3
            10 100
            20 80
            30 50
            

            Sample Output

            10
            20
            30
            
            題真的很簡(jiǎn)單,有一個(gè)陷阱就是他給的s和t的大小不一定都是s<=t的,

            一定要仔細(xì)慎重啊

            低級(jí)錯(cuò)誤
            posted on 2009-05-11 11:36 luis 閱讀(336) 評(píng)論(0)  編輯 收藏 引用

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


            <2010年2月>
            31123456
            78910111213
            14151617181920
            21222324252627
            28123456
            78910111213

            常用鏈接

            留言簿(3)

            隨筆分類

            隨筆檔案

            文章分類

            文章檔案

            友情鏈接

            搜索

            •  

            最新評(píng)論

            閱讀排行榜

            評(píng)論排行榜

            久久91精品国产91| 久久精品国产免费观看三人同眠| 国产美女亚洲精品久久久综合| 久久精品国产久精国产思思 | 国产精品久久影院| 伊人精品久久久久7777| 国产精品天天影视久久综合网| 国产精品青草久久久久福利99| 久久ww精品w免费人成| 91精品国产色综久久| 国产精品9999久久久久| 亚洲av日韩精品久久久久久a| 欧美性大战久久久久久| 欧美久久精品一级c片片| 国产亚洲婷婷香蕉久久精品| 色综合久久久久久久久五月| 久久国产成人午夜aⅴ影院| 久久国产高清字幕中文| 久久久黄色大片| 久久精品亚洲AV久久久无码| 94久久国产乱子伦精品免费| 东方aⅴ免费观看久久av| 久久精品国产亚洲Aⅴ香蕉| 狠狠色丁香婷婷综合久久来来去 | 国产高潮国产高潮久久久| 久久亚洲AV无码西西人体| 婷婷久久综合| 久久无码国产| 少妇久久久久久被弄到高潮| 国产精品gz久久久| 国产视频久久| 久久本道久久综合伊人| 久久精品视频网| 日本久久久久久中文字幕| 天天综合久久久网| 国产精品成人99久久久久| 91亚洲国产成人久久精品网址| 久久久精品免费国产四虎| 91超碰碰碰碰久久久久久综合| 色综合久久久久| 久久乐国产精品亚洲综合|