Submission #1568069

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <cstring>
#include <map>
#include <queue>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
using namespace std;

#define MOD 1000000007
#define ll long long
#define ld long double
#define FOR(i,a,b) for(ll i=(ll)a;i<(ll)b;i++)
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define mp make_pair
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define rmsame(a) sort(all(a)),a.erase(unique(all(a)), a.end())

ll N;
vector<ll> S,T;
vector<ll> sum(100001);
int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  cin >> N;
  rep(i,N){
    ll si, ti;
    cin >> si >> ti;
    si--, ti--;
    S.pb(si); T.pb(ti);
    FOR(i,si,ti) sum[i]++;
  }
  ll MAX =0;
  vector<ll> check;
  rep(i,100001){
    if(sum[i]==MAX) check.pb(i);
    if(sum[i]>MAX) {MAX=sum[i]; check.clear(); check.pb(i);}
  }

  //sort(all(check));
  ll m = check[0]; ll M = check[check.size()-1];
  rep(i,N){
    if(S[i]<= m && M < T[i]){
      cout << MAX-1 << endl;
      return 0;
    }
  }
  
  
  cout << MAX << endl;

  return 0;
}

Submission Info

Judge Result