HDU5124 lines(离散)

#include<cstdio>#include<stack>#include<cstring>#include<string>#include<algorithm>#include<iostream>#include<map>using namespace std;#define MAXN 100map<int,int>a,b;int main(){    //freopen("G://test.txt","r",stdin);    int t,i,j,k,n,temp1,temp2;    scanf("%d",&t);    while(t--){        a.clear();        b.clear();    scanf("%d",&n);    int max=0;    for(i=0;i<n;++i){    scanf("%d%d",&temp1,&temp2);    if(a.find(temp1)!=a.end())        a[temp1]++;    else    a[temp1]=1;    if(b.find(temp2+1)!=b.end())        b[temp2+1]--;    else    b[temp2+1]=-1;    if(temp2>max)        max=temp2;    }    int jia=0,jian=0,sum=0;    for(i=1;i<=max;++i){        if(a.find(i)!=a.end())            jia+=a[i];        if(b.find(i)!=b.end())            jian+=b[i];        if(jia+jian>sum)            sum=jia+jian;    }    printf("%d\n",sum);    }return 0;}