# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
259922 | Kenzo_1114 | Global Warming (CEOI18_glo) | C++17 | 75 ms | 6608 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 = 200010;
const long long int INF = 2e10 + 9;
const long long int MAX = 1e9;
int n;
long long int x, t[MAXN], dp[MAXN], l[MAXN], ans[MAXN];
int main ()
{
scanf("%d %lld", &n, &x);
dp[0] = INF;
for(int i = 1; i <= n; i++)
scanf("%lld", &t[i]), dp[i] = INF;
t[0] = -INF;
for(int i = 1; i <= n; i++)
{
int cur = i - 1;
while(t[cur] - x >= t[i]) cur = l[cur];
l[i] = cur;
}
long long int ANS = 0;
for(int i = 1; i <= n; i++)
{
int it = lower_bound(dp, dp + n, t[i]) - dp;
dp[it] = t[i];
ans[i] = it + 1;
ANS = max(ANS, ans[i]);
}
dp[0] = INF;
for(int i = 1; i <= n; i++) t[i] = MAX - t[i], dp[i] = INF;
for(int i = n; i > 0; i--)
{
int it = lower_bound(dp, dp + n, t[i]) - dp;
dp[it] = t[i];
ANS = max(ANS, it + 1 + ans[l[i]]);
}
printf("%lld\n", ANS);
}
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... |