Submission #1758554

---

Source Code Expand

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<memory>
#include<functional>
#include<set>
 
using namespace std;
 
#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
#define p(p) cout<<(p)<<" ";
#define pb push_back
#define mp make_pair
#define INF 1<<25

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pi;
typedef long long ll;

int dy[8]={1,1,1,0,0,-1,-1,-1};
int dx[8]={-1,0,1,-1,1,-1,0,1};
struct S{
	int a,b,c;
};
bool asc(const S& left,const S& right){
	return left.c > right.c;
}

int N,K;
vvi T(6,vi(6));
bool dfs(int num,int v){
	if(num==N)return (v==0);
	bool ret=false;
	rep(i,K){
		if(dfs(num+1,v^T[num][i]))ret=true;
	}
	return ret;
}
int imos[1000010];
int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	int N;
	cin>>N;
	rep(i,N){
		int a,b;cin>>a>>b;
		imos[a]++;
		imos[b+1]--;
	}
	int mx=imos[0];
	REP(i,1,1000001){
		imos[i]+=imos[i-1];
		mx=max(mx,imos[i]);
	}
	P(mx);
	return 0;
}

Submission Info

Judge Result