Submission #1774546

---

Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <fstream>
#include <sstream>
#include <set>
#include <map>
#include <vector>
#include <list>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <queue>
#include <bitset>     //UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <iomanip>        //do setprecision
#include <ctime>
#include <complex>
using namespace std;

#define FOR(i,b,e) for(int i=(b);i<(e);++i)
#define FORQ(i,b,e) for(int i=(b);i<=(e);++i)
#define FORD(i,b,e) for(int i=(b)-1;i>=(e);--i)
#define REP(x, n) for(int x = 0; x < (n); ++x)

#define ST first
#define ND second
#define PB push_back
#define MP make_pair
#define LL long long
#define ULL unsigned LL
#define LD long double

const double pi = 3.141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342;
const int mod=1000000007;

int main(){
	int n,a[100003]={},b[100003]={},max=0,ans=-1,i;
	int at,bt,btb[100003]={},idx=1;
	cin>>n;
	FOR(i,0,n){
		cin>>a[i]>>b[i];
	}
	a[n]=b[n]=mod;
	sort(a,a+n);
	sort(b,b+n);
	FOR(i,0,1000001){
		bt=lower_bound(b,b+n,i)-b-1;
		at=upper_bound(a,a+n,i)-a-1;
		//cout<<n<<":"<<at<<" "<<bt<<endl;
		//if(at==n)at=n-1;
		ans=at-bt;
		
		//cout<<ans<<endl;
		if(ans>max)max=ans;
		
		/*
		bt=lower_bound(b,b+n,i)-b;
		at=upper_bound(a,a+n,i)-a-1;
		//cout<<n<<":"<<at<<" "<<bt<<endl;
		//if(at==n)at=n-1;
		if(bt==n)bt=n-1;
		ans=at;
		if(b[bt]==i){
			btb[idx]=bt;
			idx++;
		}else{
			
		}
		ans-=btb[idx-1]-1;
		//cout<<ans<<endl;
		if(ans>max)max=ans;*/
	}
	cout<<max<<endl;
	
    return 0;
}

Submission Info

Judge Result