Submission #1443335

---

Source Code Expand

// This amazing code is by Eric Sunli Chen.
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
template<typename T> void get_int(T &x)
{
	char t=getchar();
	bool neg=false;
	x=0;
	for(; (t>'9'||t<'0')&&t!='-'; t=getchar());
	if(t=='-')neg=true,t=getchar();
	for(; t<='9'&&t>='0'; t=getchar())x=x*10+t-'0';
	if(neg)x=-x;
}
template<typename T> void print_int(T x)
{
	if(x<0)putchar('-'),x=-x;
	short a[20]= {},sz=0;
	while(x>0)a[sz++]=x%10,x/=10;
	if(sz==0)putchar('0');
	for(int i=sz-1; i>=0; i--)putchar('0'+a[i]);
}
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define get1(a) get_int(a)
#define get2(a,b) get1(a),get1(b)
#define get3(a,b,c) get1(a),get2(b,c)
#define printendl(a) print_int(a),puts("")
typedef long long LL;
typedef unsigned long long uLL;
typedef pair<int,int> pii;
const int inf=0x3f3f3f3f;
const LL Linf=1ll<<61;
const double pi=acos(-1.0);

int n,a[200111];
int t[200111];
bool check(int x)
{
	for(int i=1;i<n+n;i++)if(a[i]>=x)t[i]=1;else t[i]=0;
//	printf("t ");for(int i=1;i<n+n;i++)printf("%d ",t[i]);puts("");
	if(t[n]==t[n-1]||t[n]==t[n+1])return t[n];
	int l,r;
	for(l=n-1;l>=1&&t[l]!=t[l-1];l--);l++;
	for(r=n+1;r<n+n&&t[r]!=t[r+1];r++);r--;
	if(r-n>n-l)return t[l]^1;
	else return t[r]^1;
}
int main()
{
	get1(n);
	for(int i=1;i<n+n;i++)get1(a[i]);
	int l=1,r=n+n,mid;
	while(l<r-1)
	{
		mid=(l+r)>>1;
		if(check(mid))l=mid;
		else r=mid;
	}
	printendl(l);
	return 0;
}

Submission Info

Judge Result