112.hdu--1050--Moving Tables

思路：

用数组模拟走廊，搬桌子时将那一段value+1,输出数组最大值即可

#include<iostream>#include<algorithm>using namespace std;int main(){int t;cin>>t;while(t--){int n;cin>>n;int ar[210]={0};for(int i=0;i<n;++i){int a,b;cin>>a>>b;if(a%2 ==0)a/=2;else a=(a+1)/2;if(b%2 ==0)b/=2;else b=(b+1)/2;if(a>b){int temp;temp=b;b=a;a=temp;}for(int j=a;j<=b;++j){ar[j]++;}}sort(ar,ar+200);cout<<ar[199]*10<<endl;}return 0;}