hdu 1.3.1 Moving Tables

 1 #include<cstdio>
 2 #include<memory.h>
 3 int main()
 4 {
 5     //freopen("input.txt","r",stdin);
 6     int T,n,a,b;
 7     int s[201];
 8     int max;
 9     int t = 0;
10     int temp;
11     scanf("%d",&T);
12     while(T--)
13     {
14         scanf("%d",&n);
15         memset(s,0,sizeof(s));
16         while(n--)
17         {
18             scanf("%d%d",&a,&b);
19             if(a>b) {temp = a; a = b; b = temp;}
20             for(int i = (a+1)/2; i <= (b+1)/2; i++)
21             {
22                 s[i]++;
23             }
24         }
25         max = 1;
26         for(int i = 2; i <= 200; i++)
27         {
28             if(s[i] > s[max])
29                 max = i;
30         }
31         printf("\n%d",s[max]*10);  //该题输出需要输出最后一个空行，才能过
32     }
33 
34     return 0;
35 }