hdu 1050 Moving Tables

#include<iostream>
using namespace std;
int n,m,a[405];
int main(){
int temp1, temp2;
cin >> n;
while (n--)
{
memset(a, 0, sizeof(a));
int max = 0;
cin >> m;
for (int i = 0; i < m; i++){
cin >> temp1 >> temp2;
if (temp1>temp2){
int temp = temp1;
temp1 = temp2;
temp2 = temp;
}
if (!(temp1 % 2))
temp1 = temp1 - 1;
if (temp2 % 2)
temp2 = temp2 + 1;
for (int j = temp1; j <= temp2; j++){
a[j]++;
max = a[j] > max ? a[j] : max;
}
}
cout << max*10 << endl;
}
return 0;
}