# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1258050 | menkh | Global Warming (CEOI18_glo) | C++17 | 33 ms | 3408 KiB |
#include <bits/stdc++.h>
using namespace std;
#define MAX 200005
int a[MAX], L[MAX], R[MAX];
int b[MAX];
int n, x;
void solve() {
scanf("%d", &n, &x);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
b[i] = a[i];
}
vector<int> lis;
for (int i = 1; i <= n; i++) {
int k = lower_bound(lis.begin(), lis.end(), a[i]) - lis.begin();
if (k == lis.size()) lis.push_back(a[i]);
else lis[k] = a[i];
L[i] = lis.size();
}
reverse(b + 1, b + n + 1);
lis.clear();
for (int i = 1; i <= n; i++) {
int k = lower_bound(lis.begin(), lis.end(), b[i]) - lis.begin();
if (k == lis.size()) lis.push_back(b[i]);
else lis[k] = b[i];
R[n - i + 1] = lis.size();
}
int answer = 0;
for (int i = 0; i <= n; i++) answer = max(answer, L[i] + R[i] - 1);
printf("%d\n", answer);
}
int main() {
solve();
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |