# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
259928 | ly20 | Global Warming (CEOI18_glo) | C++17 | 99 ms | 4344 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 212345, INF = 2 * 1e9 + 10;
stack <pair <int, int> > pl;
int v[MAXN], lis1[MAXN], lis2[MAXN];
int main() {
int n, t;
scanf("%d %d", &n, &t);
lis1[0] = -INF; lis2[0] = -INF;
for(int i = 1; i <= n; i++) {
scanf("%d", &v[i]);
lis1[i] = INF; lis2[i] = INF;
}
int r1 = 0;
for(int i = n; i >= 1; i--) {
int id = lower_bound(lis1, lis1 + n, -v[i] - t) - lis1;
pl.push(make_pair(lis1[id], id));
lis1[id] = -v[i] - t;
r1 = max(r1, id);
}
for(int i = 1; i <= n; i++) {
lis1[pl.top().second] = pl.top().first;
pl.pop();
int id = lower_bound(lis2, lis2 + n, v[i]) - lis2;
lis2[id] = v[i];
int id1 = lower_bound(lis1, lis1 + n, -v[i]) - lis1;
r1 = max(r1, id + id1 - 1);
//printf("%d %d %d\n", i, id, id1);
}
printf("%d\n", r1);
}
Compilation message (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... |