1050.cpp

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

#include<iostream.h>
int n,n1;
int main()
{
	int begin[201],end[201],a[201];
	int i,j,temp;
	cin>>n;
	while(n--)
	{
		cin>>n1;
		for(i=0;i<201;i++)
			a[i]=0;
		for(i=0;i<n1;i++)
		{
			cin>>begin[i]>>end[i];
			if(begin[i]>end[i])
			{
				temp=begin[i];
				begin[i]=end[i];
				end[i]=temp;
			}
		}
		for(i=0;i<n1;i++)
		{
			if(begin[i]%2==0&&end[i]%2==0)
				for(j=begin[i]/2;j<=end[i]/2;j++)
					a[j]++;
			if(begin[i]%2!=0&&end[i]%2==0)
				for(j=(begin[i]+1)/2;j<=end[i]/2;j++)
					a[j]++;
			if(begin[i]%2==0&&end[i]%2!=0)
				for(j=begin[i]/2;j<=(end[i]+1)/2;j++)
					a[j]++;
			if(begin[i]%2!=0&&end[i]%2!=0)
				for(j=(begin[i]+1)/2;j<=(end[i]+1)/2;j++)
					a[j]++;
		}
		j = a[1];
		for(i=2;i<201;i++)
		{
			if(j<a[i])
				j=a[i];
		}
		cout<<j*10<<endl;

	}
	return 0;
}