• <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
            
            題真的很簡單,有一個陷阱就是他給的s和t的大小不一定都是s<=t的,

            一定要仔細慎重啊

            低級錯誤
            posted on 2009-05-11 11:36 luis 閱讀(338) 評論(0)  編輯 收藏 引用
            <2010年1月>
            272829303112
            3456789
            10111213141516
            17181920212223
            24252627282930
            31123456

            常用鏈接

            留言簿(3)

            隨筆分類

            隨筆檔案

            文章分類

            文章檔案

            友情鏈接

            搜索

            •  

            最新評論

            閱讀排行榜

            評論排行榜

            久久久久亚洲精品日久生情| 久久久国产精华液| 青青青伊人色综合久久| 国产99久久精品一区二区| 日本一区精品久久久久影院| 丁香五月综合久久激情| 人人狠狠综合88综合久久| 日本欧美久久久久免费播放网 | 久久精品九九亚洲精品天堂| 国产精品免费看久久久香蕉| 久久国产香蕉一区精品| 久久久久亚洲AV无码专区首JN| 精品无码久久久久久尤物| 久久精品一区二区影院| 亚洲AV无码久久寂寞少妇| 久久不射电影网| 一本大道久久东京热无码AV| 精品久久久无码人妻中文字幕豆芽| 国产免费久久久久久无码| 亚洲AV日韩精品久久久久久久| 狠狠色婷婷综合天天久久丁香| 久久综合成人网| www.久久精品| 人妻无码中文久久久久专区| 久久中文精品无码中文字幕| 青青青国产精品国产精品久久久久| 色播久久人人爽人人爽人人片AV| 久久99国产精品成人欧美| 国产高潮国产高潮久久久| 亚洲精品国精品久久99热| 97久久精品人人做人人爽| 久久综合给合久久狠狠狠97色 | 午夜精品久久久内射近拍高清| 久久免费高清视频| 国内精品久久久久影院一蜜桃| 99久久国产宗和精品1上映| 久久只有这精品99| 亚洲?V乱码久久精品蜜桃| 婷婷久久综合| 久久精品免费大片国产大片 | 久久这里的只有是精品23|