![](https://www.cnblogs.com/Images/OutliningIndicators/ExpandedBlockStart.gif)
/**//**************************************
Problem: POJ 1083 Moving Tables
Time: 0MS
Memory: 208K
Accepted Time: 2009-05-17 08:51:57
Tips: 原来我真的很菜
**************************************/
#include <stdio.h>
#include <string.h>
int a[209][2];
void swap(int &a,int &b)
![](https://www.cnblogs.com/Images/OutliningIndicators/ExpandedBlockStart.gif)
![](https://www.cnblogs.com/Images/OutliningIndicators/ContractedBlock.gif)
{
int temp=a;
a=b;
b=temp;
}
int main()
![](https://www.cnblogs.com/Images/OutliningIndicators/ExpandedBlockStart.gif)
![](https://www.cnblogs.com/Images/OutliningIndicators/ContractedBlock.gif)
{
int t;
scanf("%d",&t);
while(t--)
![](https://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
{
int n,i,j,b[409];
memset(b,0,sizeof(b));
scanf("%d",&n);
for(i=0;i<n;i++)
![](https://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
{
scanf("%d%d",&a[i][0],&a[i][1]);
if(a[i][0]>a[i][1])swap(a[i][0],a[i][1]);
if(a[i][0]%2==0)a[i][0]/=2;
else a[i][0]=a[i][0]/2+1;
if(a[i][1]%2==0)a[i][1]/=2;
else a[i][1]=a[i][1]/2+1;
}
int count=0;
for(i=0;i<n;i++)
![](https://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
{
for(j=a[i][0];j<=a[i][1];j++)b[j]++;
}
for(i=1;i<=400;i++)if(count<b[i])count=b[i];
printf("%d\n",count*10);
}
return 0;
}
![](https://www.cnblogs.com/Images/OutliningIndicators/None.gif)
posted @
2009-05-17 08:56
主函数
阅读(
291)
评论()
编辑
收藏
举报