#729177 (C++14) No.1804 Intersection of LIS

• 問題: No.1804 Intersection of LIS
• ユーザー: kwm_t
• 提出日時: 2022-01-08 01:41:01
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 299 ms / 2,000 ms
• コード長: 2,157 bytes
• コンパイル時間: 4,200 ms
• コンパイル使用メモリ: 235,368 KB
• 実行使用メモリ: 31,088 KB
• 最終ジャッジ日時: 2024-11-14 09:22:09
• 合計ジャッジ時間: 11,128 ms
• ジャッジサーバーID （参考情報）: judge1 / judge4

ファイルパターン	結果
sample	AC * 3
other	AC * 37

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
P opl(P a, P b) {
    if (a.first < b.first) return b;
    else if (a.first > b.first)return a;
    else if (a.second < b.second)return a;
    else return b;
}
P opr(P a, P b) {
    if (a.first < b.first) return b;
    else if (a.first > b.first)return a;
    else if (a.second < b.second)return b;
    else return a;
}
P e() { return { 0,-1 }; }
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n; cin >> n;
    vector<int>p(n);
    rep(i, n)cin >> p[i], p[i]--;
    vector<P>l(n), r(n);
    segtree<P, opl, e>segl(n);
    segtree<P, opr, e>segr(n);
    rep(i, n) {
        l[i] = segl.prod(0, p[i]);
        l[i].first++;
        segl.set(p[i], { l[i].first , i });
        r[i] = segr.prod(0, p[i]);
        r[i].first++;
        segr.set(p[i], { r[i].first , i });
    }
    auto get = segl.all_prod();
    int idxl = INF, idxr = -1;
    rep(i, n) {
        if (get.first == l[i].first)chmin(idxl, i);
        if (get.first == r[i].first)chmax(idxr, i);
    }
    vector<int>ansl, ansr;
    rep(i, 2) {
        while (-1 != idxl) {
            ansl.push_back(idxl);
            auto get = l[idxl];
            idxl = get.second;
        }
        swap(l, r);
        swap(ansl, ansr);
        swap(idxl, idxr);
    }
    reverse(all(ansl));
    reverse(all(ansr));
    vector<int>ans;
    rep(i, ansl.size())if (ansl[i] == ansr[i])ans.push_back(p[ansl[i]]);
    cout << ans.size() << endl;
    rep(i, ans.size())cout << ans[i] + 1 << " ";
    cout << endl;
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX