Submission #64333

ソースコード

?
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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
#include "bits/stdc++.h"
// Begin Header {{{
#pragma region
using namespace std;
using usize = size_t;
using imax = intmax_t;
#ifndef DEBUG
#define dump(...)
#endif
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)
#define repc(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)
#define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)
#define var(Type, ...) Type __VA_ARGS__; input(__VA_ARGS__)
#define let const auto
constexpr size_t operator""_zu(unsigned long long value) { return value; };
constexpr intmax_t operator""_jd(unsigned long long value) { return value; };
constexpr uintmax_t operator""_ju(unsigned long long value) { return value; };
constexpr int INF = 0x3f3f3f3f;
constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;
template <class T, class Compare = less<>>
using MaxHeap = priority_queue<T, vector<T>, Compare>;
template <class T, class Compare = greater<>>
using MinHeap = priority_queue<T, vector<T>, Compare>;
inline void input() {}
template <class Head, class... Tail>
inline void input(Head&& head, Tail&&... tail) {
cin >> head;
input(forward<Tail>(tail)...);
}
template <class Container, class Value = typename Container::value_type,
enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>
inline istream& operator>>(istream &is, Container &vs) {
for (auto &v: vs) is >> v;
return is;
}
inline void output() { cout << "\n"; }
template <class Head, class... Tail>
inline void output(Head&& head, Tail&&... tail) {
cout << head;
if (sizeof...(tail)) cout << " ";
output(forward<Tail>(tail)...);
}
template <class Container, class Value = typename Container::value_type,
enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>
inline ostream& operator<<(ostream &os, const Container &vs) {
static constexpr const char *delim[] = {" ", ""};
for (auto it = begin(vs); it != end(vs); ++it) {
os << delim[it == begin(vs)] << *it;
}
return os;
}
template <class Iterator>
inline void join(const Iterator &Begin, const Iterator &End, const string &delim = "\n", const string &last = "\n") {
for (auto it = Begin; it != End; ++it) {
cout << ((it == Begin) ? "" : delim) << *it;
}
cout << last;
}
template <class T>
inline vector<T> makeVector(const T &init_value, size_t sz) {
return vector<T>(sz, init_value);
}
template <class T, class... Args>
inline auto makeVector(const T &init_value, size_t sz, Args... args) {
return vector<decltype(makeVector<T>(init_value, args...))>(sz, makeVector<T>(init_value, args...));
}
template <class Func>
class FixPoint : Func {
public:
explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}
template <class... Args>
constexpr decltype(auto) operator()(Args&&... args) const {
return Func::operator()(*this, std::forward<Args>(args)...);
}
};
template <class Func>
static inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {
return FixPoint<Func>{forward<Func>(f)};
}
template <class Container>
struct reverse_t {
Container &c;
reverse_t(Container &c) : c(c) {}
auto begin() { return c.rbegin(); }
auto end() { return c.rend(); }
};
template <class Container>
auto reversed(Container &c) {
return reverse_t<Container>(c);
}
template <class T>
inline bool chmax(T &a, const T &b) noexcept {
return b > a && (a = b, true);
}
template <class T>
inline bool chmin(T &a, const T &b) noexcept {
return b < a && (a = b, true);
}
template <class T>
inline T diff(const T &a, const T &b) noexcept {
return a < b ? b - a : a - b;
}
void ioinit() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(10);
clog << fixed << setprecision(10);
}
#pragma endregion
// }}} End Header
signed main() {
ioinit();
var(usize, N);
assert(1 <= N && N <= usize(2e5));
vector<imax> a(N);
for (auto& ai: a) {
input(ai);
assert(1 <= ai && ai <= imax(1e9));
}
vector<imax> lis_arr(N, INF), lis_len(N), back_value(N);
vector<imax> lis_rev_arr(N, INF), lis_rev_len(N), rev_back_value(N);
rep(i, 0, N) {
*lower_bound(all(lis_arr), a[i]) = a[i];
lis_len[i] = distance(lis_arr.begin(), lower_bound(all(lis_arr), INF));
back_value[i] = *prev(lower_bound(all(lis_arr), INF));
}
repr(i, N - 1, 0) {
*lower_bound(all(lis_rev_arr), a[i]) = a[i];
lis_rev_len[i] = distance(lis_rev_arr.begin(), lower_bound(all(lis_rev_arr), INF));
rev_back_value[i] = *prev(lower_bound(all(lis_rev_arr), INF));
}
dump(lis_len);
dump(lis_rev_len);
imax res = lis_rev_len[0];
rep(i, 1, N - 1) {
if (back_value[i - 1] != back_value[i + 1]) {
chmax(res, lis_len[i - 1] + lis_rev_len[i + 1] + (back_value[i - 1] < a[i] && a[i] > rev_back_value[i + 1]));
} else {
if (back_value[i - 1] < a[i] && a[i] > rev_back_value[i + 1]) {
chmax(res, lis_len[i - 1] + lis_rev_len[i + 1] + 1);
}
}
}
chmax(res, lis_len[N - 1]);
output(res);
return 0;
}

ステータス

項目 データ
問題 1418 - 山形数列
ユーザー名 syoribu
投稿日時 2020-10-17 16:12:16
言語 C++17
状態 Accepted
得点 1
ソースコード長 5479 Byte
最大実行時間 83 ms
最大メモリ使用量 11700 KB

セット

セット 得点 Cases
1 ALL 1 / 1 *

テストケース

ファイル名 状態 実行時間 メモリ使用量 #
in01.txt AC 60 ms 5596 KB
1
in02.txt AC 19 ms 1176 KB
1
in03.txt AC 58 ms 9056 KB
1
in04.txt AC 69 ms 11388 KB
1
in05.txt AC 73 ms 11660 KB
1
in06.txt AC 68 ms 11676 KB
1
in07.txt AC 70 ms 11556 KB
1
in08.txt AC 66 ms 11564 KB
1
in09.txt AC 71 ms 11576 KB
1
in10.txt AC 68 ms 11588 KB
1
in11.txt AC 69 ms 11600 KB
1
in12.txt AC 78 ms 11616 KB
1
in13.txt AC 83 ms 11624 KB
1
in14.txt AC 69 ms 11636 KB
1
in15.txt AC 80 ms 11520 KB
1
in16.txt AC 69 ms 11652 KB
1
in17.txt AC 65 ms 11664 KB
1
in18.txt AC 79 ms 11676 KB
1
in19.txt AC 70 ms 11684 KB
1
in20.txt AC 67 ms 11700 KB
1
in21.txt AC 62 ms 11456 KB
1
in22.txt AC 74 ms 11468 KB
1
in23.txt AC 67 ms 11480 KB
1
in24.txt AC 49 ms 11620 KB
1
in25.txt AC 51 ms 11500 KB
1
in26.txt AC 46 ms 11512 KB
1
in27.txt AC 25 ms 644 KB
1
in28.txt AC 31 ms 600 KB
1
in29.txt AC 23 ms 556 KB
1
in30.txt AC 21 ms 640 KB
1
in31.txt AC 20 ms 724 KB
1
in32.txt AC 19 ms 684 KB
1
in33.txt AC 18 ms 644 KB
1
in34.txt AC 21 ms 596 KB
1
in35.txt AC 73 ms 11560 KB
1
in36.txt AC 67 ms 11576 KB
1
sample01.txt AC 28 ms 580 KB
1
sample02.txt AC 19 ms 796 KB
1