jianfei.cpp

HDOJ ACM input:The input consists of T test cases. The number of test cases ) (T is given in the fi

#include<stdio.h> 
#include<memory.h> 

int main() 
{ 
   int i,j,n,start,end,testCase,temp,max; 
   int P[200]; 
   scanf("%d",&testCase); 
   while(testCase--) 
   { 
      scanf("%d",&n); 
      memset(P,0,sizeof(P)); 
      for(i = 0;i < n; i++) 
      { 
         scanf("%d %d",&start,&end); 
         if(start > end) 
         { 
            temp = start;start = end;end = temp; 
         } 
         start = (start + 1) / 2; 
         end = (end + 1) / 2; 
         for(j = start;j <= end; j++)   //   对于每一列查找重叠次数,即该过道会被占用 
         { 
            P[j]++; 
         } 
      } 
      max = -1; 
      for(i = 0;i < 200; i++) 
         if(P[i] > max) max = P[i];   //   最大重叠数即为所求 
      printf("%d\n",max*10); 
   } 
   return 0; 
}