Submission #63809503

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
template <typename T>
using type_matrix = vector<vector<T>>;
struct hash_func {
    // ハッシュ衝突を避けるためゴールデンレシオ定数(0x9e3779b9)を使用
    static constexpr size_t GOLDEN_RATIO = 0x9e3779b9;
    template <typename T1, typename T2>
    size_t operator()(const pair<T1, T2>& P) const {
        size_t h1 = hash<T1>{}(P.first);
        size_t h2 = hash<T2>{}(P.second);
        return h1 ^ (h2 * GOLDEN_RATIO + (h1 << 6) + (h1 >> 2));
    }
    template <typename... T>
    size_t operator()(const tuple<T...>& t) const {
        size_t seed = 0;
        apply([&](const auto&... args) {
            ((seed ^= hash<decay_t<decltype(args)>>{}(args) + GOLDEN_RATIO + (seed << 6) + (seed >> 2)), ...);
        }, t);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
template <typename T>
using type_matrix = vector<vector<T>>;
struct hash_func {
    // ハッシュ衝突を避けるためゴールデンレシオ定数(0x9e3779b9)を使用
    static constexpr size_t GOLDEN_RATIO = 0x9e3779b9;
    template <typename T1, typename T2>
    size_t operator()(const pair<T1, T2>& P) const {
        size_t h1 = hash<T1>{}(P.first);
        size_t h2 = hash<T2>{}(P.second);
        return h1 ^ (h2 * GOLDEN_RATIO + (h1 << 6) + (h1 >> 2));
    }
    template <typename... T>
    size_t operator()(const tuple<T...>& t) const {
        size_t seed = 0;
        apply([&](const auto&... args) {
            ((seed ^= hash<decay_t<decltype(args)>>{}(args) + GOLDEN_RATIO + (seed << 6) + (seed >> 2)), ...);
        }, t);
        return seed;
    }
};

#ifndef ONLINE_JUDGE
#include <../../../lib.hpp>
#endif

#ifndef ONLINE_JUDGE
    // ローカルテスト関数定義
#endif

int main() {
    int n;
    cin >> n;
    vector<int> A(n);
    rep(i, n) cin >> A[i];
    vector<int> C1(n);
    vector<int> C2(n);
    unordered_set<int> S;
    for (int i = 0; i < n; i++) {
        S.insert(A[i]);
        C1[i] = (int)S.size();
    }
    S.clear();
    for (int i = n-1; i >= 0; i--) {
        S.insert(A[i]);
        C2[i] = (int)S.size();
    }
    int ans = 0;
    rep(i, n-1) {
        ans = max(ans, C1[i] + C2[i+1]);
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result