結果

問題 No.1188 レベルX門松列
ユーザー heno239heno239
提出日時 2020-08-22 13:24:32
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 161 ms / 2,000 ms
コード長 4,656 bytes
コンパイル時間 1,381 ms
コンパイル使用メモリ 124,840 KB
実行使用メモリ 39,408 KB
最終ジャッジ日時 2024-10-15 07:39:10
合計ジャッジ時間 3,800 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 45 ms
38,380 KB
testcase_01 AC 121 ms
38,424 KB
testcase_02 AC 109 ms
38,268 KB
testcase_03 AC 143 ms
38,896 KB
testcase_04 AC 118 ms
39,408 KB
testcase_05 AC 11 ms
36,288 KB
testcase_06 AC 32 ms
38,376 KB
testcase_07 AC 113 ms
39,016 KB
testcase_08 AC 113 ms
38,892 KB
testcase_09 AC 11 ms
36,292 KB
testcase_10 AC 12 ms
36,292 KB
testcase_11 AC 21 ms
36,424 KB
testcase_12 AC 21 ms
36,548 KB
testcase_13 AC 22 ms
36,548 KB
testcase_14 AC 96 ms
37,888 KB
testcase_15 AC 161 ms
39,384 KB
testcase_16 AC 13 ms
36,288 KB
testcase_17 AC 127 ms
38,872 KB
testcase_18 AC 11 ms
36,292 KB
testcase_19 AC 121 ms
38,880 KB
testcase_20 AC 11 ms
36,288 KB
testcase_21 AC 11 ms
36,292 KB
testcase_22 AC 11 ms
36,416 KB
testcase_23 AC 11 ms
36,292 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 21;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

ul gcd(ul a, ul b) {
	if (a < b)swap(a, b);
	while (b) {
		ul r = a % b; a = b; b = r;
	}
	return a;
}

struct SegT {
private:
	int sz; vector<int> node;
	const int init_c = 0;
public:
	SegT(vector<int> v) {
		int n = v.size();
		sz = 1;
		while (sz < n)sz *= 2;
		node.resize(2 * sz - 1, init_c);
		rep(i, n) {
			node[i + sz - 1] = v[i];
		}
		per(i, sz - 1) {
			node[i] = f(node[2 * i + 1], node[2 * i + 2]);
		}
	}
	SegT(int n) {
		sz = 1;
		while (sz < n)sz *= 2;
		node.resize(2 * sz - 1, init_c);
	}
	int f(int a, int b) {
		return max(a, b);
	}
	void update(int k, int a) {
		k += sz - 1;
		node[k] = f(node[k],a);
		while (k > 0) {
			k = (k - 1) / 2;
			node[k] = f(node[k * 2 + 1], node[k * 2 + 2]);
		}
	}
	int query(int a, int b, int k = 0, int l = 0, int r = -1) {
		if (r < 0)r = sz;
		if (r <= a || b <= l)return init_c;
		else if (a <= l && r <= b)return node[k];
		else {
			int vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
			int vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
			return f(vl, vr);
		}
	}
};

vector<int> calc(vector<int> a,int sz) {
	int n = a.size();
	SegT st(sz);
	vector<int> res(n);
	rep(i, n) {
		int val = st.query(0, a[i]);
		st.update(a[i], val + 1);
		res[i] = val + 1;
	}
	return res;
}
void solve() {
	int n; cin >> n;
	vector<int> a(n);
	rep(i, n)cin >> a[i];
	vector<int> v = a; sort(all(v));
	v.erase(unique(all(v)), v.end());
	rep(i, n) {
		a[i] = lower_bound(all(v), a[i]) - v.begin();
	}
	int ans = 0;
	vector<int> a1 = calc(a, v.size());
	reverse(all(a));
	vector<int> a2 = calc(a, v.size());
	reverse(all(a)); reverse(all(a2));
	rep(i, n) {
		int mi = min(a1[i], a2[i]);
		ans = max(ans, mi - 1);
	}
	rep(i, n)a[i] = v.size() - 1 - a[i];
	a1 = calc(a, v.size());
	reverse(all(a));
	a2 = calc(a, v.size());
	reverse(all(a)); reverse(all(a2));
	rep(i, n) {
		int mi = min(a1[i], a2[i]);
		ans = max(ans, mi - 1);
	}
	cout << ans << "\n"; 
}

signed main() {
	//ios::sync_with_stdio(false);
	//cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//expr();
	//int t; cin >> t; rep(i, t)
	//while (cin >> n >> m>>s1>>s2>>t, n)
	solve();
	return 0;
}
0