HDOJ 1050：Moving Tables 解题报告

#include <iostream>
#include <algorithm>
//#include <fstream>
using namespace std;
int f[201];

int main()
{
//ifstream cin("1050_input.txt");	//调试用
int t, n, i, j, s, e;
cin >> t;
while( t-- ){
memset( f, 0, sizeof(f) );
cin >> n;	//n=1→200
for( i=0; i<n; i++ ){
cin >> s >> e;	//s=start e=end
s = (s+1)/2;
e = (e+1)/2;
if( s > e ){	//保证s<=e
int temp = s;
s = e;
e = temp;
}
for( j=s; j<=e; j++)
f[j]++;
}
int consume = 0;
for( i=1; i<=200; i++ )
consume = max( consume, f[i] );
cout << consume*10 << endl;
}
//system("pause");
return 0;
}