• <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 閱讀(337) 評論(0)  編輯 收藏 引用
            <2009年5月>
            262728293012
            3456789
            10111213141516
            17181920212223
            24252627282930
            31123456

            常用鏈接

            留言簿(3)

            隨筆分類

            隨筆檔案

            文章分類

            文章檔案

            友情鏈接

            搜索

            •  

            最新評論

            閱讀排行榜

            評論排行榜

            久久精品二区| 欧美精品久久久久久久自慰| 色综合久久中文字幕无码| 久久综合噜噜激激的五月天| 国产精品一久久香蕉国产线看观看| 久久水蜜桃亚洲av无码精品麻豆 | 伊人久久无码中文字幕| 午夜天堂精品久久久久| 久久久精品免费国产四虎| 久久久久久A亚洲欧洲AV冫| 婷婷伊人久久大香线蕉AV| 国产精品久久久久久搜索| 人妻系列无码专区久久五月天| 久久精品夜色噜噜亚洲A∨| 伊人久久综合无码成人网| 久久99精品国产麻豆不卡| 人妻无码久久一区二区三区免费| 欧美噜噜久久久XXX| 欧洲国产伦久久久久久久| 国产成人精品白浆久久69| 欧美成a人片免费看久久| 国产精品久久成人影院| 午夜精品久久久久| 狠狠色综合久久久久尤物| 精品乱码久久久久久久| 亚洲精品无码成人片久久| 久久久久久久精品妇女99| 久久精品亚洲乱码伦伦中文| 青青草原1769久久免费播放| 久久人人爽人人爽人人片AV不 | 国产精品美女久久福利网站| 天天久久狠狠色综合| 久久久久综合网久久| 久久精品中文无码资源站 | 久久免费美女视频| 色综合久久综精品| 久久免费美女视频| 久久涩综合| 久久99热这里只有精品66| 一极黄色视频久久网站| 区久久AAA片69亚洲|