# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1241611 | Jer | Global Warming (CEOI18_glo) | C++20 | 2095 ms | 1860 KiB |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
int b[MAXN], a[MAXN];
int n, x;
int find_size()
{
vector<int> sub;
for (int i = 0; i < n; i++)
{
auto it = lower_bound(sub.begin(), sub.end(), a[i]);
if (it == sub.end())
sub.push_back(a[i]);
else
*it = a[i];
}
return sub.size();
}
int main()
{
scanf("%d%d", &n, &x);
for (int i = 0; i < n; i++)
scanf("%d", &b[i]);
int res = 0;
for (int i = 0; i < n; i++)
for (int j = i; j < n; j++)
for (int c = -x; c <= x; c++)
{
for (int k = 0; k < n; k++)
{
if (k >= i and k <= j)
a[k] = b[k] + x;
else
a[k] = b[k];
}
res = max(res, find_size());
}
printf("%d\n", res);
return 0;
}
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... |